Strong list-chromatic index of planar graphs with Ore-degree at most seven (Q6083189): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-023-02714-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4387458395 / rank
 
Normal rank
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: Colouring graphs with sparse neighbourhoods: bounds and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong edge-coloring for graphs with small edge weight / rank
 
Normal rank
Property / cites work
 
Property / cites work: List strong edge coloring of planar graphs with maximum degree 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong list-chromatic index of subcubic graphs / 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 graphs with maximum degree four / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong list edge coloring of subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the strong chromatic index of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2804765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs with maximum degree 4 are strongly 19-edge-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong chromatic index of a class of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List strong edge-coloring of graphs with maximum degree 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On strong list edge coloring of subcubic graphs / rank
 
Normal rank

Latest revision as of 10:10, 3 August 2024

scientific article; zbMATH DE number 7757614
Language Label Description Also known as
English
Strong list-chromatic index of planar graphs with Ore-degree at most seven
scientific article; zbMATH DE number 7757614

    Statements

    Strong list-chromatic index of planar graphs with Ore-degree at most seven (English)
    0 references
    0 references
    0 references
    0 references
    31 October 2023
    0 references
    0 references
    strong edge-coloring
    0 references
    strong edge-choosability
    0 references
    Ore-degree
    0 references
    planar graphs
    0 references
    0 references