✦ LIBER ✦

Generalized fibonacci maximum path graphs

✍ Scribed by Martin Charles Golumbic; Yehoshua Perl

Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 723 KB
Volume: 28
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(79)90131-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs Where Every Maximal Path Is Maxim

Graphs Where Every Maximal Path Is Maximum

✍ Michael Tarsi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 682 KB

We give a complete characterization of all graphs in which every simple path is contained in a maximum path. Among Hamiltonian graphs, such graphs were previously characterized by C. Thomassen.

Maximum generic nullity of a graph

✍ Leslie Hogben; Bryan Shader 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 223 KB

Maximum nullity of outerplanar graphs an

Maximum nullity of outerplanar graphs and the path cover number

✍ John Sinkovic 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 151 KB

Maximum matchings in general graphs thro

Maximum matchings in general graphs through randomization

✍ Michael O Rabin; Vijay V Vazirani 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 679 KB

Maximum number of disjoint paths connect

Maximum number of disjoint paths connecting specified terminals in a graph

✍ Hananya Yinnone 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 907 KB

Maximum (g,f)-factors of a general graph

✍ William Y.C. Chen 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 472 KB

Chen, W. Y. C., Maximum (g, f)-factors of a general graph, Discrete Mathematics 91 (1991) l-7. This paper presents a characterization of maximum (g, f)-factors of a general graph in which multiple edges and loops are allowed. An analogous characterization of the minimum (g,f)-factors of a general gr