The \(k\)-strong induced arboricity of a graph (Q2408964): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1607.07174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering and packing in graphs IV: Linear arboricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factors and factorizations of graphs—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on adjacent vertex distinguishing colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive coloring of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795218 / 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: 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: An inequality involving the vertex arboricity and edge arboricity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The point-arboricity of a graph / 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: Surfaces, tree-width, clique-minors, and partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally identifying coloring in bounded expansion classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2963895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838186 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The thickness of graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692719 / 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: 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: Recent advances in algorithms and combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for ramsey numbers R(3, 3, ?, 3) and Schur numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank

Latest revision as of 12:22, 14 July 2024

scientific article
Language Label Description Also known as
English
The \(k\)-strong induced arboricity of a graph
scientific article

    Statements

    The \(k\)-strong induced arboricity of a graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 October 2017
    0 references
    induced forests
    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