On the tree-width of even-hole-free graphs (Q1979431): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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: W3195643205 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2008.05504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property Testing for Bounded Degree Databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4100119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every minor-closed property of sparse graphs is testable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth for graphs with small chordality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique‐cutsets beyond chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of (pan, even hole)‐free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and algorithms for (cap, even hole)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction obstructions for treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Property Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing in bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Graph Partitions for Approximation and Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing subdivision-freeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks and forbidden minors II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Property of Hyperfinite Graphs Is Testable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. V. Excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the treewidth of planar even-hole-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing on \(k\)-vertex-connectivity of graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:34, 26 July 2024

scientific article
Language Label Description Also known as
English
On the tree-width of even-hole-free graphs
scientific article

    Statements

    On the tree-width of even-hole-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 September 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph minors
    0 references
    tree-width
    0 references
    contraction of subgraphs
    0 references
    0 references
    0 references