Disclosing Barriers: A Generalization of the Canonical Partition Based on Lovász’s Formulation

DOI10.1007/978-3-319-03780-6_35zbMath1407.05195arXiv1212.5960OpenAlexW126331835MaRDI QIDQ2867138

Nanao Kita

Publication date: 10 December 2013

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.5960

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Signed analogue of general Kotzig-Lovász decomposition ⋮ Graft analogue of general Kotzig-Lovász decomposition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Conservative weightings and ear-decompositions of graphs
• An O ( VE ) algorithm for ear decompositions of matching-covered graphs
• Coverings of Bipartite Graphs
• A Partially Ordered Structure and a Generalization of the Canonical Partition for General Graphs with Perfect Matchings
• Two Algorithms for Bipartite Graphs
• Matrices and matroids for systems analysis

This page was built for publication: Disclosing Barriers: A Generalization of the Canonical Partition Based on Lovász’s Formulation