Aboulker, P, Radovanovic, M, Trotignon, N et al. (2 more authors) (2013) Linear balanceable and subcubic balanceable graphs. Journal of Graph Theory. ISSN 0364-9024
Abstract
In Math Program 55(1992), 129–168, Conforti and Rao conjectured that every balanced bipartite graph contains an edge that is not the unique chord of a cycle. We prove this conjecture for balanced bipartite graphs that do not contain a cycle of length 4 (also known as linear balanced bipartite graphs), and for balanced bipartite graphs whose maximum degree is at most 3. We in fact obtain results for more general classes, namely linear balanceable and subcubic balanceable graphs. Additionally, we prove that cubic balanced graphs contain a pair of twins, a result that was conjectured by Morris, Spiga, and Webb in ( Discrete Math 310(2010), 3228–3235).
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 08 Jul 2013 10:15 |
Last Modified: | 15 Sep 2014 03:20 |
Published Version: | http://dx.doi.org/10.1002/jgt.21728 |
Status: | Published |
Publisher: | Wiley Blackwell |
Identification Number: | 10.1002/jgt.21728 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:75838 |