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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6590873 / rank
 
Normal rank
Property / zbMATH Keywords
 
list edge-coloring
Property / zbMATH Keywords: list edge-coloring / rank
 
Normal rank
Property / zbMATH Keywords
 
total coloring
Property / zbMATH Keywords: total coloring / rank
 
Normal rank
Property / zbMATH Keywords
 
Halin graphs
Property / zbMATH Keywords: Halin graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
tree-width 3
Property / zbMATH Keywords: tree-width 3 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1489471257 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1504.05252 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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