Premium
Proof of Mader's conjecture on k ‐critical n ‐connected graphs
Author(s) -
Jianji Su
Publication year - 2004
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.10164
Subject(s) - combinatorics , mathematics , conjecture , disjoint sets , pairwise comparison , graph , discrete mathematics , order (exchange) , cograph , line graph , 1 planar graph , statistics , economics , finance
Mader conjectured that every k ‐critical n ‐connected noncomplete graph G has 2k + 2 pairwise disjoint fragments. The author in 9 proved that the conjecture holds if the order of G is greater than ( k + 2) n . Now we settle this conjecture completely. © 2004 Wiley Periodicals, Inc. J Graph Theory 45: 281–297, 2004
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom