Balanced cycles and holes in bipartite graphs

DOI10.1016/S0012-365X(98)00283-0zbMATH Open0939.05050WikidataQ126472657 ScholiaQ126472657MaRDI QIDQ1297428FDOQ1297428

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

Publication date: 5 July 2000

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

Recommendations

• scientific article; zbMATH DE number 597814
• Odd cycles and matrices with integrality properties
• A partition of bipartite graphs with 4-cycle and 8-cycle
• Independent cycles and paths in bipartite balanced graphs
• Perfect matchings of regular bipartite graphs

zbMATH Keywords

bipartite graphsigned graphchordless cyclelinear algorithm

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Cycles in 2-factors of balanced bipartite graphs
• Title not available (Why is that?)
• Balanced matrices
• Acyclically pushable bipartite permutation digraphs: an algorithm
• Title not available (Why is that?)
• Bisimplicial vertices in even-hole-free graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1297428)