A note on total and list edge-colouring of graphs of tree-width 3 (Q293637): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3142409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List-colourings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List edge colourings of some 1-factorable multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The list chromatic index of a bipartite multigraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: List edge-colorings of series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The total chromatic number of any multigraph with maximum degree five is at most seven / 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: Q4135588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741180 / rank
 
Normal rank

Latest revision as of 02:41, 12 July 2024

scientific article
Language Label Description Also known as
English
A note on total and list edge-colouring of graphs of tree-width 3
scientific article

    Statements

    A note on total and list edge-colouring of graphs of tree-width 3 (English)
    0 references
    0 references
    9 June 2016
    0 references
    list edge-coloring
    0 references
    total coloring
    0 references
    Halin graphs
    0 references
    tree-width 3
    0 references

    Identifiers