𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Path-Bicolorable Graphs

✍ Scribed by Andreas Brandstädt; Martin Charles Golumbic; Van Bang Le; Marina Lipshteyn

Publisher
Springer Japan
Year
2011
Tongue
English
Weight
344 KB
Volume
27
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Path graphs
Path graphs
✍ H. J. Broersma; C. Hoede 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 766 KB

The concept of a line graph is generalized to that of a path graph. The path graph f,(G) of a graph G is obtained by representing the paths Pk in G by vertices and joining two vertices whenever the corresponding paths f k in G form a path f k + , or a cycle C,. f,-graphs are characterized and invest

Hamiltonian path graphs
Hamiltonian path graphs
✍ Gary Chartrand; S. F. Kapoor; E. A. Nordhaus 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 389 KB

## Abstract The Hamiltonian path graph __H(G)__ of a graph __G__ is that graph having the same vertex set as __G__ and in which two vertices __u__ and __v__ are adjacent if and only if __G__ contains a Hamiltonian __u‐v__ path. A characterization of Hamiltonian graphs isomorphic to their Hamiltonia

Path-positive graphs
Path-positive graphs
✍ R.B. Bapat; A.K. Lal 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 1023 KB
Path connected graphs
Path connected graphs
✍ R. J. Faudree; R. H. Schelp 📂 Article 📅 1974 🏛 Akadmiai Kiad 🌐 English ⚖ 467 KB
On Path-amenable Graphs
On Path-amenable Graphs
✍ Gabriel Dirac; Ove Steen Nielsen 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 373 KB