Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths (Q4978291): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Path chromatic numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning into graphs with only small components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. I: Discharging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. II: Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxed two-coloring of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Relaxed Two-Colourability: A Hardness Jump / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 4-Color Theorem for Surfaces of Genus g / rank
 
Normal rank
Property / cites work
 
Property / cites work: List strong linear 2-arboricity of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 1-improper 2-coloring of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5560916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring Planar Graphs With Three Colours and No Large Monochromatic Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Islands in Graphs on Surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition of a planar graph with girth 6 into two forests with chain length at most 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improper choosability of graphs and maximum average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded size components -- partitions and transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph coloring with no large monochromatic components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-colorings: non-colorable graphs and NP-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linear vertex-arboricity of a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Improper Colourings of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defective choosability of graphs without small minors / rank
 
Normal rank

Latest revision as of 05:17, 14 July 2024

scientific article; zbMATH DE number 6758793
Language Label Description Also known as
English
Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths
scientific article; zbMATH DE number 6758793

    Statements

    Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths (English)
    0 references
    0 references
    0 references
    0 references
    8 August 2017
    0 references
    planar graph decomposition
    0 references
    defective coloring
    0 references
    fragmented coloring
    0 references
    path forests
    0 references
    2-coloring
    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
    0 references