Theory and applications of graphs : proceedings, Michigan, May 11-15, 1976
Αποθηκεύτηκε σε:
| Συγγραφή απο Οργανισμό/Αρχή: | |
|---|---|
| Άλλοι συγγραφείς: | , |
| Μορφή: | Livre numérique |
| Γλώσσα: | Anglais |
| Έκδοση: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Σειρά: | Lecture notes in mathematics
642 |
| Θέματα: | |
| Διαθέσιμο Online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Σημείωση: |
Actes de la conférence tenue à la Western Michigan University à Kalamazoo (Mich.) du 11 au 15 mai 1976 Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Theory and applications of graphs, proceedings, Michigan, May 11-15, 1976, edited by Y. Alavi and D. R. Lick, 1978, Berlin, Springer-Verlag, 1 vol. (XIV-635 p.), Lecture notes in mathematics, 3-540-08666-8 • Theory and Applications of Graphs, Texte imprimé, 9783662167311 |
Πίνακας περιεχομένων:
- 200 years of graph theory A guided tour
- Chromatic number and subgraphs of cayley graphs
- The multicolorings of graphs and hypergraphs
- Irreducible configurations and the four color conjecture
- Numbered complete graphs, unusual rulers, and assorted applications
- Cycles and semi-topological configurations
- Graphs with unique walks, trails or paths of given lengths
- Triangular imbeddings into surfaces of a join of equicardinal independent sets following an Eulerian graph
- Mixed graphs of homomorphisms
- On chromatic equivalence of graphs
- On graphs having prescribed clique number, chromatic number, and maximum degree
- Domination of undirected graphs A survey
- Some extremal problems for simple two-complexes
- Various length paths in graphs
- Orthogonal groups over GF(2) and related graphs
- Distance matrix polynomials of trees
- Odd cycles and perfect graphs
- Imbeddings of metacyclic cayley graphs
- On the chromatic index and the cover index of a multigraph
- Pruning and depth first search
- Graphs and their degree sequences: A survey
- The bichromaticity of a tree
- On diameter stability of graphs
- Generalized pseudosurface embeddings of graphs and associated block designs
- Powers of graphs, line graphs, and total graphs
- The cartesian product of two graphs is stable
- A note on a generalized regularity condition
- Long and short walks in trees
- Random clumps, graphs, and polymer solutions
- Mixed ramsey numbers: Edge chromatic numbers vs. graphs
- Planar and outerplanar cayley graphs of free groups
- Coloring restrictions
- If a hadamard matrix of order 24 has character exactly 2, its transpose is known
- Cycle lengths in polytopal graphs
- Subgraph connectivity numbers of a graph
- Matchings in graphs III: Infinite graphs
- Steinhaus graphs.-Packing and covering constants for recursive trees
- The minimum degree and connectivity of a graph
- Generalizations of graphical parameters
- Pursuit-evasion in a graph
- Regularity in tournaments
- On graphs of embedding range one
- Non-existence of graph embeddings
- Food webs, competition graphs, and the boxicity of ecological phase space
- Hamiltonian persistency is periodic among iterated line digraphs
- Some problems in ramsey theory
- Exactly thirteen connected cubic graphs have integral spectra
- A counting theorem for topological graph theory
- k-Arc Hamilton graphs
- Hypohamiltonian graphs and digraphs
- Order preserving embeddings of aographs
- Circular arc graphs: New uses and a new algorithm
- Chromatic sums
- Infinite cayley graphs of connectivity one
- Edge-colorings of graphs A survey
- Menger and könig systems.