✦ LIBER ✦

On Graver's conjecture concerning the rigidity problem of graphs

✍ Scribed by Hiroshi Maehara

Book ID: 110561396
Publisher: Springer
Year: 1991
Tongue: English
Weight: 143 KB
Volume: 6
Category: Article
ISSN: 0179-5376
DOI: 10.1007/bf02574693

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a conjecture concerning the reconstru

On a conjecture concerning the reconstruction of graphs

✍ Roger M Bryant 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 138 KB

On a conjecture concerning the orientati

On a conjecture concerning the orientation number of a graph

✍ K.L. Ng 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 701 KB

The proof of Ushio’s conjecture concerni

The proof of Ushio’s conjecture concerning path factorization of complete bipartite graphs

✍ Beiliang Du; Jian Wang 📂 Article 📅 2006 🏛 SP Science China Press 🌐 English ⚖ 205 KB

On an extremal problem concerning the th

On an extremal problem concerning the theory of graphs

✍ Chong-Yun Chao 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 276 KB

On a conjecture of Hoàng and Tu concerni

On a conjecture of Hoàng and Tu concerning perfectly orderable graphs

✍ Stefan Hougardy 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 129 KB

On a conjecture of Gallai concerning com

On a conjecture of Gallai concerning complete subgraphs of k-critical graphs

✍ H.L. Abbott; B. Zhou 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 418 KB

Abbott, H.L. and B. Zhou, On a conjecture of Gallai concerning complete subgraphs of k-critical graphs, Discrete Mathematics 100 (1992) 223-228. A graph G is said to be k-critical if it has chromatic number k but every proper subgraph of G has a (k -l)-coloring. T. Gallai asked whether each k-criti