𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimum node covers and 2-bicritical graphs

✍ Scribed by W. R. Pulleyblank

Publisher
Springer-Verlag
Year
1979
Tongue
English
Weight
672 KB
Volume
17
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum cycle covers of graphs
Minimum cycle covers of graphs
✍ Fan, Genghua 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 1 views

Some new results on minimum cycle covers are proved. As a consequence, it is obtained that the edges of a bridgeless graph G can be covered by cycles of total length at most |E(G)| + 25 24 (|V (G)| -1), and at most |E(G)| + |V (G)| -1 if G contains no circuit of length 8 or 12.

Minimum vertex-diameter-2-critical graph
Minimum vertex-diameter-2-critical graphs
✍ Ya-Chen Chen; Zoltán Füredi 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 182 KB 👁 1 views

## Abstract We prove that the minimum number of edges in a vertex‐diameter‐2‐critical graph on __n__ ≥ 23 vertices is (5__n__ − 17)/2 if __n__ is odd, and is (5__n__/2) − 7 if __n__ is even. © 2005 Wiley Periodicals, Inc. J Graph Theory

Distance-regular Graphs with b2=1 and An
Distance-regular Graphs with b2=1 and Antipodal Covers
✍ Makoto Araya; Akira Hiraki; Aleksandar Jurisić 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 234 KB

We show that a distance-regular graph of valency k Ͼ 2 is antipodal , if b 2 ϭ 1 . This answers Problem (i) on p . 182 of Brouwer , Cohen and Neumaier [4] .