Balanced cycles and holes in bipartite graphs

DOI10.1016/S0012-365X(98)00283-0zbMath0939.05050WikidataQ126472657 ScholiaQ126472657MaRDI QIDQ1297428

Kristina Vušković, Michele Conforti, Cornuéjols, Gérard

Publication date: 5 July 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

bipartite graphsigned graphchordless cyclelinear algorithm

Mathematics Subject Classification ID

Paths and cycles (05C38) Signed and weighted graphs (05C22)

Related Items (2)

Balanced matrices ⋮ Acyclically pushable bipartite permutation digraphs: an algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Alpha-balanced graphs and matrices and GF(3)-representability of matroids
• On a Class of Totally Unimodular Matrices
• Forbidden subgraphs and graph decomposition
• Dividing a Graph into Triconnected Components
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs

This page was built for publication: Balanced cycles and holes in bipartite graphs