A sufficient condition for edge 6-colorable planar graphs with maximum degree 6 (Q832998): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2022.01.018 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2022.01.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4220881176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some sufficient conditions for a planar graph of maximum degree six to be Class 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4014299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic \(\epsilon \in \{-1, -2, -3\}\) / 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: On Tutte's extension of the four-colour problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5558480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for a planar graph to be class I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for a plane graph with maximum degree 6 to be class 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph with maximum degree 7 is of class 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on graphs of class I / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2022.01.018 / rank
 
Normal rank

Latest revision as of 04:30, 10 December 2024

scientific article
Language Label Description Also known as
English
A sufficient condition for edge 6-colorable planar graphs with maximum degree 6
scientific article

    Statements

    Identifiers

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