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.
Na inny język
z treści źródłowej
arxiv.org
Głębsze pytania