Matching cutsets in graphs
From MaRDI portal
Publication:5203060
DOI10.1002/jgt.3190130502zbMath0725.05055MaRDI QIDQ5203060
Publication date: 1989
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190130502
Related Items
Unnamed Item, 3-consecutive edge coloring of a graph, On stable cutsets in claw-free graphs and planar graphs, Matching cutsets in graphs of diameter 2, Satisfactory graph partition, variants, and generalizations, On stable cutsets in line graphs, On stable cutsets in graphs, Extremal graphs having no matching cuts, The complexity of the matching-cut problem for planar graphs and other graph classes
Cites Work