Fast recognition of doubled graphs

DOI10.1016/j.tcs.2013.11.020zbMath1277.05075OpenAlexW1994851674MaRDI QIDQ385965

Frédéric Maffray

Publication date: 13 December 2013

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

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

zbMATH Keywords

recognitiondouble split graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Perfect graphs (05C17)

Related Items

Star covers and star partitions of double-split graphs

Cites Work

• Unnamed Item
• The strong perfect graph theorem
• The splittance of a graph
• Geometric algorithms and combinatorial optimization
• A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
• Forbidden Induced Subgraphs of Double-split Graphs
• An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph