| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996466763403316 |
|
|
Titolo |
Graph theory, Singapore 1983 : proceedings of the first Southeast Asian graph theory colloquium, held in Singapore, May 10-28, 1983 / / edited by K. M. Koh and H. P. Yap |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Germany ; ; New York, New York : , : Springer-Verlag, , [1984] |
|
©1984 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1984.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XVI, 336 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Mathematics, , 0075-8434 ; ; 1073 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Graph theory |
Combinatorial analysis |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di contenuto |
|
On supercompact graphs III: The edge nucleus -- Monochromatic reachability, complementary cycles, and single arc reversals in tournaments -- Cycles in abelian cayley graphs with a proscribed vertex -- On the minimum number of arcs to reverse to make a graph strongly connected -- Computational complexity of graph properties -- Lectures on the marriage theorem of aharoni, nash-williams and shelah -- A graphical colour-representation of a group -- General connectivity -- Cube factors -- Concentric subgraphs, closed subsets and dense graphs -- The binding number of product graphs -- Rigidity of multi-graphs II -- The mobility of a graph -- Random subgraphs of regular graphs -- Graph factors with given properties -- Some definitions of central structures -- Equalities involving certain graphical distributions -- A collection of sets related to the tutte polynomial of a matroid -- Are all polyominoes arbitrarily graceful? -- Generalized ramsey theory XV: Achievement and avoidance games for bipartite graphs -- On the reconstructibility of almost complete r-partite graphs -- Graphical colour-representation of an inverse semigroup -- Eulerian chains and segment reversals -- Degree sequences of connected hypergraphs and hypertrees -- The computational complexity of recognizing critical sets -- An algorithm for the directed T-immersion of a graph -- Reconstruction conjecture for square of a tree -- Cycle |
|
|
|
|
|
|
|
|
|
|
graphs -- Chain decompositions of graphs, 1: Abstract graphs -- Chain decompositions of graphs, 2: Surface embeddings -- Unsolved problems. |
|
|
|
|
|
| |