Notes on graph product structure theory (Q2058955): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Nonrepetitive colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shorter Labeling Schemes for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple-Source Shortest Paths in Embedded Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Map graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on tree decomposition of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for centered colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two lower bounds for $p$-centered colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minor-Closed Graph Classes with Bounded Layered Pathwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure of Graphs with Locally Restricted Crossings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Graphs Have Bounded Queue-Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear separators, fragility and subexponential expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Sublinear Separators and Polynomial Expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: On classes of graphs with strongly sublinear separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth of graphs with balanced separations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial expansion and sublinear separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for String Graphs and its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a New Separator Theorem for String Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the theory of Pfaffian orientations. II: \(T\)-joins, \(k\)-cuts, and duality of enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring and Covering Nowhere Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Cut of a Planar Graph in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameters Tied to Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing Queues and Stacks As Machines for Laying Out Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicat Representation of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderings on graphs and game coloring number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intrinsic dimensionality of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separators for sphere-packings and nearest neighbor graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterisations and examples of graph classes with bounded expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing string graphs is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XVI: Excluding a non-planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generalised colouring numbers of graphs that exclude a fixed minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tree-partition-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique minors in Cartesian products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring graphs with bounded generalized colouring number / rank
 
Normal rank

Latest revision as of 11:00, 27 July 2024

scientific article
Language Label Description Also known as
English
Notes on graph product structure theory
scientific article

    Statements

    Notes on graph product structure theory (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 December 2021
    0 references
    Cartesian product
    0 references
    strong product of graphs
    0 references
    path decomposition
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references