scientific article; zbMATH DE number 7378385

DOI10.4230/LIPIcs.MFCS.2018.68zbMath1494.68195arXiv1804.05258MaRDI QIDQ5005172

Arash Rafiey, Jing Huang, Ross M. McConnell, Pavol Hell

Publication date: 4 August 2021

Full work available at URL: https://arxiv.org/abs/1804.05258

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph theoryinterval graphsinterval bigraphsmin orderingco-TT graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Min-Orderable Digraphs ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• On recognition of threshold tolerance graphs and their complements
• Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
• List homomorphisms to reflexive graphs
• Polynomial graph-colorings
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Efficient graph representations
• Linear-time recognition of circular-arc graphs
• Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
• Permuting matrices to avoid forbidden submatrices
• List homomorphisms and circular arc graphs
• Incidence matrices and interval graphs
• Co-TT graphs and a characterization of split co-TT graphs
• Representation characterizations of chordal bipartite graphs
• Approximation of Minimum Cost Homomorphisms
• Ordering without Forbidden Patterns
• The LBFS Structure and Recognition of Interval Graphs
• Representation of a finite graph by a set of intervals on the real line
• Characterizations of totally balanced matrices
• Doubly Lexical Orderings of Matrices
• Threshold tolerance graphs
• Three Partition Refinement Algorithms
• Interval digraphs: An analogue of interval graphs
• Classifying the Complexity of Constraints Using Finite Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item