Fragments in kcritical n‐connected graphs
Author:
- 1 November 1995
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 20 (3) , 287-295
Abstract
Madar conjectured that every k‐critical n‐connected non‐complete graph G has (2k + 2) pairwise disjoint fragments. We show that Mader's conjecture holds if the order of G is greater than (k + 2)n. From this, it implies that two other conjectures on k‐critical n‐connected graphs posed by Entringer, Slater, and Mader also hold if the cardinality of the graphs is large. © 1995 John Wiley & Sons, Inc.Keywords
This publication has 6 references indexed in Scilit:
- Fragments in 2-Critically n-Connected GraphsJournal of Combinatorial Theory, Series B, 1993
- Disjunkte Fragmente in kritisch n-fach zusammenhängenden GraphenEuropean Journal of Combinatorics, 1985
- Connectivity and edge-connectivity in finite graphs1979
- On k-critical, n-connected graphsDiscrete Mathematics, 1977
- A Note on k-Critically n-Connected GraphsProceedings of the American Mathematical Society, 1977
- Endlichkeitss tze f rk-kritische GraphenMathematische Annalen, 1977