Strict chordal and strict split digraphs (Q516787): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2016.02.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2298045254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The LBFS Structure and Recognition of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3971999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval digraphs: An analogue of interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / 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 ellipsoid method and its consequences in combinatorial optimization / 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: Q3495376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4032986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward Characterization of Perfect Elimination Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning chordal graphs into independent sets and cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Incremental Linear-Time Algorithm for Recognizing Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split digraphs / 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: Subpath acyclic digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing interval digraphs and interval bigraphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4774066 / 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: Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank

Latest revision as of 13:53, 13 July 2024

scientific article
Language Label Description Also known as
English
Strict chordal and strict split digraphs
scientific article

    Statements

    Strict chordal and strict split digraphs (English)
    0 references
    0 references
    0 references
    15 March 2017
    0 references
    0 references
    split digraph
    0 references
    chordal digraph
    0 references
    perfect digraph
    0 references
    recognition algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references