4 papers
Feedback Set Problems on Bounded-Degree (Planar) Graphs
Tian Bai, Yixin Cao, Mingyu Xiao
The feedback set problems are about removing the minimum number of vertices or edges from a graph to break all its cycles. Much effort has gone into understanding their complexity…
Characterization of Circular-arc Graphs: II. McConnell Flipping
Yixin Cao, Tomasz Krawczyk
McConnell [FOCS 2001] presented a flipping transformation from circular-arc graphs to interval graphs with certain patterns of representations. Beyond its algorithmic implications,…
Characterization of Chordal Circular-arc Graphs: I. Split Graphs
Yixin Cao, Jan Derbisz, Tomasz Krawczyk
The most elusive problem around the class of circular-arc graphs is identifying all minimal graphs that are not in this class. The main obstacle is the lack of a systematic way of…
Characterization of Circular-arc Graphs: III. Chordal Graphs
Yixin Cao, Tomasz Krawczyk
We identify all minimal chordal graphs that are not circular-arc graphs, thereby resolving one of ``the main open problems'' concerning the structures of circular-arc graphs as pos…