Tree-depth, subgraph coloring and homomorphism bounds (Q2493118): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Acyclic coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star arboricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Nonplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic colorings of planar graphs / 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: Universal \(H\)-colorable graphs without a given configuration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality of \(A\)-mote graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal partial order represented by means of oriented trees and other simple graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local-Global Phenomena in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4389332 / 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: Q5692719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the order of countable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality theorems for finite structures (characterising gaps and good characterisations) / 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: Optimal node ranking of tree in linear time / rank
 
Normal rank

Latest revision as of 16:50, 24 June 2024

scientific article
Language Label Description Also known as
English
Tree-depth, subgraph coloring and homomorphism bounds
scientific article

    Statements

    Tree-depth, subgraph coloring and homomorphism bounds (English)
    0 references
    9 June 2006
    0 references
    0 references
    chromatic number
    0 references
    graph partitions
    0 references
    minor closed class
    0 references
    decomposition
    0 references
    0 references