Characterising bounded expansion by neighbourhood complexity (Q1621072): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Polynomial-time data reduction for dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Meta) Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphism preservation on quasi-wide classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization and Sparseness: the case of Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability, Definability, and Model-Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidimensionality and Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2957874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding first-order properties of locally tree-decomposable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization using structural parameters on sparse graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2963895 / 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: Structure theorem and isomorphism test for graphs with excluded topological subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mean, Median and Mode in Binomial Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions / 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: 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: Graph minors. XVI: Excluding a non-planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of graphs not admitting a fixed immersion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring graphs with bounded generalized colouring number / rank
 
Normal rank

Revision as of 09:12, 17 July 2024

scientific article
Language Label Description Also known as
English
Characterising bounded expansion by neighbourhood complexity
scientific article

    Statements

    Characterising bounded expansion by neighbourhood complexity (English)
    0 references
    15 November 2018
    0 references
    weak \(r\)-colouring number
    0 references

    Identifiers