Lexicographic Orientation Algorithms (Q3120444): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-71840-8_12 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2809063493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally semicomplete digraphs: A generalization of tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted cycle factors and arc-decompositions of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi‐transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completing orientations of partially oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robbins's Theorem for Mixed Multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint paths in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Frank's conjecture on \(k\)-connected orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Comparability Graphs and of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of comparability graph recognition and coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Sandwich Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two remarks on circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of local tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation characterizations of chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4262243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending partial representations of proper and unit interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation of a finite graph by a set of intervals on the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2758332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time recognition of circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular decomposition and transitive orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitive Orientation of Graphs and Identification of Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Graphs, with an Application to a Problem of Traffic Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3898496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nombre chromatique et plus longs chemins d'un graphe / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular-arc graphs with clique cover number two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly connected non-2-linked digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly 2-connected orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization problems for graphs, partially ordered sets, lattices, and families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Test for Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring a Family of Circular Arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix characterizations of circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5331780 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:26, 18 July 2024

scientific article
Language Label Description Also known as
English
Lexicographic Orientation Algorithms
scientific article

    Statements

    Lexicographic Orientation Algorithms (English)
    0 references
    0 references
    4 March 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers