Strict chordal and strict split digraphs
From MaRDI portal
Publication:516787
DOI10.1016/j.dam.2016.02.009zbMath1358.05125OpenAlexW2298045254WikidataQ59815572 ScholiaQ59815572MaRDI QIDQ516787
César Hernández-Cruz, Pavol Hell
Publication date: 15 March 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.02.009
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
- Split digraphs
- The strong perfect graph theorem
- The ellipsoid method and its consequences in combinatorial optimization
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Recognizing interval digraphs and interval bigraphs in polynomial time
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- Partitioning chordal graphs into independent sets and cliques
- Subpath acyclic digraphs
- Chordal digraphs
- Incidence matrices and interval graphs
- Recognizing Berge graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- The LBFS Structure and Recognition of Interval Graphs
- Representation of a finite graph by a set of intervals on the real line
- Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Interval digraphs: An analogue of interval graphs
- An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Toward Characterization of Perfect Elimination Digraphs
- Perfect Digraphs
- A Characterization of Comparability Graphs and of Interval Graphs
