On Coloring Problems of Snark Families (Q2840681): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.endm.2011.05.009 / rank
Normal rank
 
Property / cites work
 
Property / cites work: The Colour Numbers of Complete Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The total-chromatic number of some families of snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special classes of snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Snarks of order 18 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the total coloring of certain graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4294635 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ENDM.2011.05.009 / rank
 
Normal rank

Latest revision as of 00:45, 20 December 2024

scientific article
Language Label Description Also known as
English
On Coloring Problems of Snark Families
scientific article

    Statements

    On Coloring Problems of Snark Families (English)
    0 references
    0 references
    0 references
    23 July 2013
    0 references
    snark
    0 references
    graph coloring
    0 references
    total coloring
    0 references
    total chromatic number
    0 references
    vertex coloring
    0 references
    dot product
    0 references
    NP-completeness
    0 references
    cubic bridgeless graphs
    0 references
    Loupekhine family
    0 references
    Blanusa families
    0 references
    snark recognition problem
    0 references

    Identifiers

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