Lexicographic Orientation Algorithms
From MaRDI portal
Publication:3120444
DOI10.1007/978-3-319-71840-8_12zbMath1407.05112OpenAlexW2809063493MaRDI QIDQ3120444
Publication date: 4 March 2019
Published in: Springer Monographs in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-71840-8_12
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strongly 2-connected orientations of graphs
- Disjoint paths in tournaments
- Extending partial representations of proper and unit interval graphs
- Two remarks on circular arc graphs
- Circular-arc graphs with clique cover number two
- The directed subgraph homeomorphism problem
- Highly connected non-2-linked digraphs
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- The complexity of comparability graph recognition and coloring
- Modular decomposition and transitive orientation
- Linear-time recognition of circular-arc graphs
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- On the structure of local tournaments
- List homomorphisms and circular arc graphs
- On Frank's conjecture on \(k\)-connected orientations
- Restricted cycle factors and arc-decompositions of digraphs
- Representation characterizations of chordal bipartite graphs
- Matrix characterizations of circular-arc graphs
- Representation of a finite graph by a set of intervals on the real line
- Locally semicomplete digraphs: A generalization of tournaments
- Robbins's Theorem for Mixed Multigraphs
- An Efficient Test for Circular-Arc Graphs
- A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
- Coloring a Family of Circular Arcs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Completing orientations of partially oriented graphs
- Quasi‐transitive digraphs
- Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs
- Graph Sandwich Problems
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- Transitiv orientierbare Graphen
- Nombre chromatique et plus longs chemins d'un graphe
- Characterizing circular-arc graphs
- Transitive Orientation of Graphs and Identification of Permutation Graphs
- A Characterization of Comparability Graphs and of Interval Graphs
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
This page was built for publication: Lexicographic Orientation Algorithms
