Perfect matchings. A theory of matching covered graphs (to appear)

DOI10.1007/978-3-031-47504-7MaRDI QIDQ6199029zbMATH OpenOpenAlexFDO

Authors Cláudio L. Lucchesi, U. S. R. Murty

Publication date 23 February 2024

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

Full work available at URL https://doi.org/10.1007/978-3-031-47504-7

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
• Matching covered graphs and subdivisions of \(K_ 4\) and \(\bar C_ 6\)
• scientific article; zbMATH DE number 1944136
• Matching covered graphs
• On the number of dissimilar pfaffian orientations of graphs

Cited in

(10)

• Cyclewidth and the grid theorem for perfect matching width of bipartite graphs
• A characterization of nonfeasible sets in matching covered graphs
• Planar cycle-extendable graphs
• Wheel-like bricks and minimal matching covered graphs
• Forcing, anti-forcing, global forcing and complete forcing on perfect matchings of graphs -- a survey
• Claw-free solid bricks
• Nice vertices in cubic graphs
• The number of perfect matchings in a brick
• Matching (multi)cut: algorithms, complexity, and enumeration
• On the d-blocker number of k-ary n-cubes

This page was built for publication: Perfect matchings. A theory of matching covered graphs (to appear)

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