Planar graphs with maximum degree 4 are strongly 19-edge-colorable (Q1744746): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The strong chromatic index of a cubic graph is at most 10 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems and results in combinatorial analysis and graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5752590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong chromatic index of subcubic planar multigraphs / rank
 
Normal rank

Revision as of 12:28, 15 July 2024

scientific article
Language Label Description Also known as
English
Planar graphs with maximum degree 4 are strongly 19-edge-colorable
scientific article

    Statements

    Planar graphs with maximum degree 4 are strongly 19-edge-colorable (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 April 2018
    0 references
    strong edge-coloring
    0 references
    strong chromatic index
    0 references
    plane graph
    0 references
    discharging method
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references