Subclasses of circular-arc bigraphs: Helly, normal and proper
From MaRDI portal
Publication:2132386
DOI10.1016/J.ENTCS.2019.08.044OpenAlexW2977719991WikidataQ113317387 ScholiaQ113317387MaRDI QIDQ2132386FDOQ2132386
Authors: F. S. Kolberg, Marina Groshaus, André L. P. Guedes 
Publication date: 27 April 2022
Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.044
Recommendations
Cites Work
- Linear-time recognition of circular-arc graphs
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- Biclique graphs and biclique matrices
- On hereditary Helly classes of graphs
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- The maximum edge biclique problem is NP-complete
- Interval bigraphs and circular arc graphs
- Recognizing interval digraphs and interval bigraphs in polynomial time
- Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
- Proper Helly Circular-Arc Graphs
- Circular-arc bigraphs and its subclasses
- Title not available (Why is that?)
- New characterizations of proper interval bigraphs and proper circular arc bigraphs
Cited In (1)
This page was built for publication: Subclasses of circular-arc bigraphs: Helly, normal and proper
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2132386)
