New characterizations of proper interval bigraphs

DOI10.1016/j.akcej.2015.06.007zbMath1330.05113OpenAlexW1442688857MaRDI QIDQ896097

Ritapa Chakraborty, Ashok Kumar Das

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

zbMATH Keywords

proper interval bigraphastral triple of edgescircularly compatible 1'sdominating pair of verticesmonotone consecutive arrangementzero partitionable

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs ⋮ Graphs and digraphs represented by intervals and circular arcs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bigraphs/digraphs of Ferrers dimension 2 and asteroidal triple of edges
• Circular-arc graphs with clique cover number two
• A new characterization of proper interval graphs
• Characterization problems for graphs, partially ordered sets, lattices, and families of sets
• Recognizing interval digraphs and interval bigraphs in polynomial time
• Algorithmic graph theory and perfect graphs
• Matrix characterizations of circular-arc graphs
• Structure theorems for some circular-arc graphs
• Representation of a finite graph by a set of intervals on the real line
• Interval digraphs: An analogue of interval graphs
• An Efficient Test for Circular-Arc Graphs
• Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders
• Asteroidal Triple-Free Graphs
• Interval bigraphs and circular arc graphs

This page was built for publication: New characterizations of proper interval bigraphs