On the generalised colouring numbers of graphs that exclude a fixed minor (Q5920084): 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: W2755112968 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1602.09052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cops, robbers, and threatening skeletons / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a pursuit game played on graphs for which a minor is excluded / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with linearly bounded Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4601883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-factor approximation of the domination number in sparse graphs / 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: Neighborhood complexity and kernelization for nowhere dense classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring and Covering Nowhere Dense 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: S-functions for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple competitive graph coloring algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radius two trees specify χ‐bounded classes / 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: Q2726740 / 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: Q5692719 / 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: 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: A short note about pursuit games played on a graph with a given genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors XXIII. Nash-Williams' immersion conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for complete minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring graphs with bounded generalized colouring number / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:55, 14 July 2024

scientific article; zbMATH DE number 6773730
Language Label Description Also known as
English
On the generalised colouring numbers of graphs that exclude a fixed minor
scientific article; zbMATH DE number 6773730

    Statements

    On the generalised colouring numbers of graphs that exclude a fixed minor (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 September 2017
    0 references
    0 references
    colouring numbers
    0 references
    0 references
    0 references