Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: Non-separating paths in 4-connected graphs
Author: Kawarabayashi, KI
Lee, O
Yu, XX
Abstract: In 1975, Lovasz conjectured that for any positive integer k, there exists a minimum positive integer f (k) such that, for any two vertices x, y in any f (k)-connected graph G, there is a path P from x to y in G such that G V ( P) is k-connected. A result of Tutte implies f ( 1) = 3. Recently, f ( 2) = 5 was shown by Chen et al. and, independently, by Kriesell. In this paper, we show that f ( 2) = 4 except for double wheels.
Subject: non-separating path
4-connected graph
Lovasz conjecture
Country: Suíça
Editor: Birkhauser Verlag Ag
Rights: fechado
Identifier DOI: 10.1007/s00026-005-0240-4
Date Issue: 2005
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000241529400004.pdf193.29 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.