Extremal graphs having no matching cuts

DOI10.1002/jgt.20576zbMath1234.05127OpenAlexW1976347563MaRDI QIDQ3113291

Andrzej Proskurowski, Arthur M. Farley, Paul Bonsma

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

primitive graphextremal graphmatching cutmatching immune

Mathematics Subject Classification ID

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

Related Items (2)

Monochromatic disconnection: Erdős-Gallai-type problems and product graphs ⋮ Good edge-labelling of graphs

Cites Work

• Unnamed Item
• On stable cutsets in line graphs
• On simple characterizations of k-trees
• Recognizing decomposable graphs
• The complexity of the matching-cut problem for planar graphs and other graph classes
• Matching cutsets in graphs
• ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS
• A Note on Primitive Graphs

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