Equimatchable factor‐critical graphs

DOI10.1002/JGT.3190100403MaRDI QIDQ4722091zbMATH OpenOpenAlexFDO

Authors Odile Favaron

Publication date 1986

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190100403

zbMATH Keywords

equimatchablefactor-criticalmatching

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• 2-connected factor-critical graphs \(G\) with exactly \(|E(G)| + 1\) maximum matchings
• Factor-critical graphs with given number of maximum matchings
• Factor-critical graph \(G\) with \(|V (G)|+2\) maximum matchings
• Equimatchable Graphs on Surfaces
• Equimatchable bipartite graphs

Cited in

(16)

• Totally equimatchable graphs
• Equimatchable claw-free graphs
• On two extensions of equimatchable graphs
• On two equimatchable graph classes
• Closure and factor-critical graphs
• Equimatchable bipartite graphs
• Efficient recognition of equimatchable graphs
• Edge-stable equimatchable graphs
• Equimatchable Graphs on Surfaces
• Equimatchable regular graphs
• Edge-Critical Equimatchable Bipartite Graphs
• Triangle‐free equimatchable graphs
• Graphs with each edge in at most one maximum matching
• Critical equimatchable graphs
• Common matching number of a graph
• Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\)

This page was built for publication: Equimatchable factor‐critical graphs

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