Core Concepts
Identifying minimal split graphs not in the circular-arc class.
Abstract
The article discusses the characterization of chordal circular-arc graphs, focusing on split graphs. It explores the connection between minimal split graphs and non-circular-arc graphs, providing insights into forbidden induced subgraphs. The authors present algorithms and theorems to recognize circular-arc graphs and establish relationships between different graph classes. The content delves into the complexities of characterizing chordal circular-arc graphs and provides detailed explanations and proofs for the theorems presented.
Stats
McConnell [11] presented a transformation algorithm recognizing circular-arc graphs.
Theorem 1.1 ([9]) states the conditions for a graph to be an interval graph.
Theorem 1.2 provides equivalence conditions for a graph to be a circular-arc graph.
Quotes
"The most elusive problem around the class of circular-arc graphs is identifying all minimal graphs that are not in this class."