Subclasses of circular-arc bigraphs: Helly, normal and proper
From MaRDI portal
Publication:2132386
Recommendations
Cites work
- scientific article; zbMATH DE number 403948 (Why is no real title available?)
- Biclique graphs and biclique matrices
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Circular-arc bigraphs and its subclasses
- Interval bigraphs and circular arc graphs
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- Linear-time recognition of circular-arc graphs
- New characterizations of proper interval bigraphs and proper circular arc bigraphs
- On hereditary Helly classes of graphs
- Proper Helly Circular-Arc Graphs
- Recognizing interval digraphs and interval bigraphs in polynomial time
- The maximum edge biclique problem is NP-complete
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)