Graph Theory Singapore 1983 : Proceedings of the First Southeast Asian Graph Theory Colloquium, held in Singapore May 10 28, 1983
Сохранить в:
| Соавтор: | |
|---|---|
| Другие авторы: | , |
| Формат: | Livre numérique |
| Язык: | Anglais |
| Опубликовано: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Серии: | Lecture notes in mathematics
1073 |
| Предметы: | |
| 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 |
| Примечание: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • 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, 1984, Berlin [etc.], Springer-Verlag, 1 vol. (XIII-335 p.), Lecture notes in mathematics, 0-387-13368-2 • Graph Theory Singapore 1983, Texte imprimé, 9783662193716 |
Оглавление:
- 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.