Matching covered graphs
From MaRDI portal
Recommendations
Cited in
(23)- Minimal 2-matching-covered graphs
- On the perfect matching graph defined by a set of cycles
- 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\)
- Laminar tight cuts in matching covered graphs
- Equivalence classes in matching covered graphs
- scientific article; zbMATH DE number 1808637 (Why is no real title available?)
- Graphs with independent perfect matchings
- scientific article; zbMATH DE number 5308553 (Why is no real title available?)
- Matching covered graphs with three removable classes
- On perfect matchings in matching covered graphs
- On matching cover of graphs
- scientific article; zbMATH DE number 221322 (Why is no real title available?)
- A note on tight cuts in matching-covered graphs
- On 2-matching covered graphs and 2-matching deleted graphs
- On nonfeasible edge sets in matching-covered graphs
- Cubic graphs with 3-edge coloring of graphs
- p-matchings in graphs: a brief survey with some open problems
- scientific article; zbMATH DE number 975376 (Why is no real title available?)
- On matching number, decomposition and representation of well-formed graph
- A characterization of nonfeasible sets in matching covered graphs
- Perfect matchings. A theory of matching covered graphs (to appear)
- How many matchings cover the nodes of a graph?
This page was built for publication: Matching covered graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3582518)
