New characterizations of proper interval bigraphs
DOI10.1016/J.AKCEJ.2015.06.007zbMATH Open1330.05113OpenAlexW1442688857MaRDI QIDQ896097FDOQ896097
Authors: Ashok Kumar Das, Ritapa Chakraborty
Publication date: 11 December 2015
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.akcej.2015.06.007
Recommendations
proper interval bigraphastral triple of edgescircularly compatible 1'sdominating pair of verticesmonotone consecutive arrangementzero partitionable
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new characterization of proper interval graphs
- Algorithmic graph theory and perfect graphs
- An Efficient Test for Circular-Arc Graphs
- Asteroidal Triple-Free Graphs
- Bigraphs/digraphs of Ferrers dimension 2 and asteroidal triple of edges
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- Characterizations for unit interval bigraphs
- Circular-arc graphs with clique cover number two
- Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders
- Interval bigraphs and circular arc graphs
- Interval digraphs: An analogue of interval graphs
- Matrix characterizations of circular-arc graphs
- Recognizing interval digraphs and interval bigraphs in polynomial time
- Representation of a finite graph by a set of intervals on the real line
- Structure theorems for some circular-arc graphs
Cited In (11)
- Graphs and digraphs represented by intervals and circular arcs
- Bigraphs/digraphs of Ferrers dimension 2 and asteroidal triple of edges
- New characterizations of proper interval bigraphs and proper circular arc bigraphs
- A new characterization of proper interval graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bigraph impropriety
- Asteroidal-triple-free interval \(k\)-graphs
- Characterizations for unit interval bigraphs
- Circularly compatible ones, \(D\)-circularity, and proper circular-arc bigraphs
This page was built for publication: New characterizations of proper interval bigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896097)