Subclasses of circular-arc bigraphs: Helly, normal and proper

DOI10.1016/j.entcs.2019.08.044OpenAlexW2977719991WikidataQ113317387 ScholiaQ113317387MaRDI QIDQ2132386

F. S. Kolberg, André L. P. Guedes, Marina Groshaus

Publication date: 27 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.044

zbMATH Keywords

recognitionnormalcircular-arcproperbicliqueHelly

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Characterizations and recognition of circular-arc graphs and subclasses: a survey
• Characterization problems for graphs, partially ordered sets, lattices, and families of sets
• Recognizing interval digraphs and interval bigraphs in polynomial time
• The maximum edge biclique problem is NP-complete
• Linear-time recognition of circular-arc graphs
• Proper Helly Circular-Arc Graphs
• Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
• Interval bigraphs and circular arc graphs
• Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
• New Characterizations of Proper Interval Bigraphs and Proper Circular Arc Bigraphs
• Biclique graphs and biclique matrices
• Circular‐Arc Bigraphs and Its Subclasses

This page was built for publication: Subclasses of circular-arc bigraphs: Helly, normal and proper