Vertex elimination orderings for hereditary graph classes (Q2514166): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2107127602 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59897244 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1205.2535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimplicial vertices in even-hole-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separability generalizes Dirac's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: LexBFS-orderings and powers of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs. IV: Decomposition theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even and odd holes in cap-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally signable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs part I: Decomposition theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of even-hole-free graphs with star cutsets and 2-joins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulated neighborhoods in even-hole-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-in-a-path problem for claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Some Edge-Partition Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i><sup>2</sup>/log <i>t</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Square-3PC($\cdot, \cdot$)-Free Berge Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770411 / 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: Alpha-balanced graphs and matrices and GF(3)-representability of matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The world of hereditary graph classes viewed through Truemper configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5790850 / rank
 
Normal rank

Latest revision as of 14:25, 9 July 2024

scientific article
Language Label Description Also known as
English
Vertex elimination orderings for hereditary graph classes
scientific article

    Statements

    Vertex elimination orderings for hereditary graph classes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 January 2015
    0 references
    lexbfs
    0 references
    Truemper configurations
    0 references
    elimination ordering
    0 references
    algorithms for classes of graphs
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers