Strong edge-colouring of sparse planar graphs (Q477354): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067104586 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1401.4568 / 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: Precise upper bound for the strong edge chromatic number of sparse planar graphs / 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: On strong edge-colouring of subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong edge-coloring of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge coloring of embedded graphs with large girth / 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: Planar graphs of maximum degree seven are Class I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5558480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph with maximum degree 7 is of class 1 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:03, 9 July 2024

scientific article
Language Label Description Also known as
English
Strong edge-colouring of sparse planar graphs
scientific article

    Statements

    Identifiers

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