Extremal graphs having no matching cuts

DOI10.1002/JGT.20576MaRDI QIDQ3113291zbMATH OpenOpenAlexFDO

Authors Paul Bonsma, Arthur M. Farley, Andrzej Proskurowski

Publication date 8 February 2012

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

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

zbMATH Keywords

extremal graphmatching cutmatching immuneprimitive graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Recommendations

• A characterization of extremal graphs with no matching-cut
• scientific article; zbMATH DE number 3869366
• Matching cutsets in graphs
• On matchings in graphs
• Graphs with independent perfect matchings

Cites work

• A Note on Primitive Graphs
• scientific article; zbMATH DE number 3869366 (Why is no real title available?)
• Matching cutsets in graphs
• ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS
• On simple characterizations of k-trees
• On stable cutsets in line graphs
• Recognizing decomposable graphs
• The complexity of the matching-cut problem for planar graphs and other graph classes

Cited in

(10)

• Extremal graphs having no stable cutset
• Monochromatic disconnection: Erdős-Gallai-type problems and product graphs
• scientific article; zbMATH DE number 3869366 (Why is no real title available?)
• A characterization of extremal graphs with no matching-cut
• scientific article; zbMATH DE number 1885934 (Why is no real title available?)
• scientific article; zbMATH DE number 844155 (Why is no real title available?)
• Good edge-labelling of graphs
• On conflict-free cuts: algorithms and complexity
• The complexity of the perfect matching-cut problem
• Sparse vertex cutsets and the maximum degree

This page was built for publication: Extremal graphs having no matching cuts

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