The vertex-critical graph conjecture (critical graph conjecture respectively) states that every vertex-critical (critical) graph has an odd number of vertices. In this note we prove that if G is a critical graph of even order, then G has at least three vertices of less-than-maximum valency. In addit
✦ LIBER ✦
Remarks on the theory of graph characteristics
✍ Scribed by L. Szamkołowicz
- Book ID
- 112746340
- Publisher
- Springer
- Year
- 1974
- Tongue
- English
- Weight
- 279 KB
- Volume
- 98
- Category
- Article
- ISSN
- 0373-3114
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Remarks on the critical graph conjecture
✍
I. Broere; C.M. Mynhardt
📂
Article
📅
1979
🏛
Elsevier Science
🌐
English
⚖ 344 KB
REMARKS ON THE SPHERE OF INFLUENCE GRAPH
✍
David Avis; Joe Horton
📂
Article
📅
1985
🏛
John Wiley and Sons
🌐
English
⚖ 215 KB
Two remarks on retracts of graph product
✍
Sandi Klavžar
📂
Article
📅
1992
🏛
Elsevier Science
🌐
English
⚖ 545 KB
KlavZar, S., Two remarks on retracts of graph products, Discrete Mathematics 109 (1992) 155-160. Let H be a bipartite graph and let G,, be the Mycielski graph with x(G) = n, n 3 4. Then the chromatic number of the strong product of G, by H is at most 2n -2. We use this result to show that there exi
Further remarks on partitioning the edge
✍
A.J.W Hilton; Rhys Price Jones
📂
Article
📅
1978
🏛
Elsevier Science
🌐
English
⚖ 80 KB
Some remarks on the chromatic index of a
✍
Ivan Tafteberg Jakobsen
📂
Article
📅
1973
🏛
Springer
🌐
English
⚖ 525 KB
Some Remarks on the Convexity Number of
✍
John Gimbel
📂
Article
📅
2003
🏛
Springer Japan
🌐
English
⚖ 235 KB