Matching cutsets in graphs of diameter 2

DOI10.1016/j.tcs.2008.07.002zbMath1153.68037MaRDI QIDQ955037

Mieczysław Borowiecki, Katarzyna Jesse-Józefczyk

Publication date: 18 November 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.07.002

zbMATH Keywords

graph algorithms; stable cutset; matching cutset

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

Improper C-colorings of graphs, 3-consecutive edge coloring of a graph, Satisfactory graph partition, variants, and generalizations

Cites Work

• Maximal and minimal vertex-critical graphs of diameter two
• Coloring graphs with stable cutsets
• Graphs of diameter two with no 4-circuits
• Modular decomposition and transitive orientation
• Stable set bonding in perfect graphs and parity graphs
• On stable cutsets in line graphs
• On stable cutsets in graphs
• Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
• Size in maximal triangle-free graphs and minimal graphs of diameter 2
• Efficient and Practical Algorithms for Sequential Modular Decomposition
• Recognizing decomposable graphs
• Matching cutsets in graphs
• Unnamed Item
• Unnamed Item