A Partially Ordered Structure and a Generalization of the Canonical Partition for General Graphs with Perfect Matchings

DOI10.1007/978-3-642-35261-4_12zbMath1260.05129arXiv1205.3816OpenAlexW2963430613MaRDI QIDQ4909525

Nanao Kita

Publication date: 21 March 2013

Published in: Algorithms and Computation (Search for Journal in Brave)

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

zbMATH Keywords

decompositionperfect matchingsgraph structurescanonicl partition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (4)

Signed analogue of general Kotzig-Lovász decomposition ⋮ Graft analogue of general Kotzig-Lovász decomposition ⋮ A note on extreme sets ⋮ Disclosing Barriers: A Generalization of the Canonical Partition Based on Lovász’s Formulation

This page was built for publication: A Partially Ordered Structure and a Generalization of the Canonical Partition for General Graphs with Perfect Matchings