Premium
K ‐linked graphs with girth condition
Author(s) -
Kawarabayashi Kenichi
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.10150
Subject(s) - combinatorics , mathematics , girth (graph theory) , graph , odd graph , discrete mathematics , triangle free graph , graph power , line graph , 1 planar graph
Recently, Mader [7] proved that every 2 k ‐connected graph with girth g ( G ) sufficiently large is k ‐linked. We show here that g ( G ≥ 11 will do unless k = 4,5. If k = 4,5, then g ( G ) ≥ 19 will do. © 2003 Wiley Periodicals, Inc. J Graph Theory 45: 48–50, 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