On low tree-depth decompositions (Q897253): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star arboricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic colorings of graphs on surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rankings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar orientations with low out-degree and compaction of adjacency matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / 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: Domination Problems in Nowhere-Dense Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding any graph as a minor allows a low tree-width 2-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs and well‐quasi‐ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden graphs for tree-depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing first-order properties for subclasses of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transition graphs and the star-height of regular events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Where First-Order and Monadic Second-Order Logic Coincide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph Isomorphism in Planar Graphs and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter and treewidth in minor-closed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thue choosability of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of linear graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of first-order and monadic second-order logic revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2957485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Trees Grow Low: Shrubs and Fast MSO1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trivially perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding First-Order Properties of Nowhere Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Automata, Digraph Connectivity, and Regular Expression Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosability of P 5-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LIFO-Search on Digraphs: A Searching Game for Cycle-Rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of monadic second-order queries on trees / 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: Every graph of sufficiently large average degree contains a \(C_4\)-free subgraph of large average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Lower Bounds for Simple Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphisms and edge-colourings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time low tree-width partitions and algorithmic consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-depth, subgraph coloring and homomorphism bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad and classes with bounded expansion. I: Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad and classes with bounded expansion. II: Algorithmic aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many \(F\)'s are there in \(G\)? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On nowhere dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On first-order definable colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the order of countable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphism preservation theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal node ranking of tree in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph searching and a min-max theorem for tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Five-coloring graphs on the torus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring graphs with bounded generalized colouring number / rank
 
Normal rank

Revision as of 04:49, 11 July 2024

scientific article
Language Label Description Also known as
English
On low tree-depth decompositions
scientific article

    Statements

    On low tree-depth decompositions (English)
    0 references
    17 December 2015
    0 references
    graph decomposition
    0 references
    tree-depth
    0 references
    low tree-depth decomposition
    0 references
    classes with bounded expansion
    0 references
    nowhere dense classes
    0 references
    homomorphism duality
    0 references
    model checking
    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

    Identifiers

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