Characterizing path graphs by forbidden induced subgraphs (Q3652563): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
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: Efficient parallel recognition algorithms of cographs and distance hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit 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 recognition algorithm for the intersection graphs of paths in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / 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: Q3271426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on 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: Topics in Intersection Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3689221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The forbidden subgraph characterization of directed vertex graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection representations of graphs by arcs / 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: A faster algorithm to recognize undirected path graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3439694 / rank
 
Normal rank

Latest revision as of 07:09, 2 July 2024

scientific article
Language Label Description Also known as
English
Characterizing path graphs by forbidden induced subgraphs
scientific article

    Statements

    Characterizing path graphs by forbidden induced subgraphs (English)
    0 references
    0 references
    0 references
    0 references
    18 December 2009
    0 references
    intersection graphs
    0 references
    path graphs
    0 references
    forbidden induced subgraphs
    0 references

    Identifiers