✦ LIBER ✦

Path-Partition Structures of Graphs and Digraphs

✍ Scribed by McDiarmid, C. J. H.

Book ID: 120102723
Publisher: Oxford University Press
Year: 1974
Tongue: English
Weight: 413 KB
Volume: s3-29
Category: Article
ISSN: 0024-6115
DOI: 10.1112/plms/s3-29.4.750

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partitions of digraphs into paths or cir

Partitions of digraphs into paths or circuits

✍ W. Bienia; H. Meyniel 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 178 KB

The problem of partitioning the arcs of a digraph into elementary paths has been considered first by B. Alspach and N.J. Pullman in . We consider the slightly different problem of partitioning the arcs of a digraph into elementary paths or circuits. A general conjecture is given which is solved in p

The even-path problem for graphs and dig

The even-path problem for graphs and digraphs

✍ Andrea S. Lapaugh; Christos H. Papadimitriou 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 357 KB

Initial vertex partitioning and testing

Initial vertex partitioning and testing isomorphism of graphs and digraphs

✍ Kabekode V. S. Bhat; M. H. Rahnavard 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 531 KB

On the k-path partition of graphs

✍ George Steiner 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 150 KB

Graphs with a path partition for structu

Graphs with a path partition for structuring digital spaces

✍ Šlapal, Josef 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 469 KB

Hamiltonian cycles and paths in Cayley g

Hamiltonian cycles and paths in Cayley graphs and digraphs — A survey

✍ Stephen J. Curran; Joseph A. Gallian 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 927 KB

Cayley graphs arise naturally in computer science, in the study of word-hyperbolic groups and automatic groups, in change-ringing, in creating Escher-like repeating patterns in the hyperbolic plane, and in combinatorial designs. Moreover, Babai has shown that all graphs can be realized as an induced