Graphs where each spanning tree has a perfect matching
From MaRDI portal
Publication:3391323
Recommendations
- The contractible edges of a spanning tree and a perfect matching in k-connected graphs
- The spanning k-trees, perfect matchings and spectral radius of graphs
- A note on matchings and spanning trees with bounded degrees
- On the anti-Kekulé problem of cubic graphs
- Anti-forcing number of some specific graphs
Cites work
- Graph theory with applications
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 5238980 (Why is no real title available?)
- On the anti-Kekulé and anti-forcing number of cata-condensed phenylenes
- On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids
- On the anti-Kekulé number and odd cycle transversal of regular graphs
- On the anti-Kekulé number of (4, 5, 6)-fullerenes
- On the anti-Kekulé number of a hexagonal system
- On the anti-Kekulé number of fullerenes
- On the anti-Kekulé number of leapfrog fullerenes
- The Anti-Kekule number of the infinite triangular, rectangular and hexagonal grids
- The Factorization of Linear Graphs
Cited in
(6)- On anti-Kekulé and s-restricted matching preclusion problems
- Construction and characterization of graphs whose each spanning tree has a perfect matching
- Finding spanning trees with perfect matchings
- Graphs whose the maximum size of an odd subgraph equal to \(\lfloor \frac{n}{2} \rfloor \)
- Regular graphs with equal weakly connected domination number and matching number
- Counting matchable spanning trees of join graphs
This page was built for publication: Graphs where each spanning tree has a perfect matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3391323)
