On a limit of the method of Tashkinov trees for edge-colouring (Q297916): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(9 intermediate revisions by 8 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2016.03.025 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6595287 / rank
 
Normal rank
Property / zbMATH Keywords
 
edge colouring
Property / zbMATH Keywords: edge colouring / rank
 
Normal rank
Property / zbMATH Keywords
 
Goldberg-Seymour conjecture
Property / zbMATH Keywords: Goldberg-Seymour conjecture / rank
 
Normal rank
Property / zbMATH Keywords
 
multigraphs
Property / zbMATH Keywords: multigraphs / rank
 
Normal rank
Property / zbMATH Keywords
 
Tashkinov tree
Property / zbMATH Keywords: Tashkinov tree / rank
 
Normal rank
Property / zbMATH Keywords
 
Kempe changes
Property / zbMATH Keywords: Kempe changes / rank
 
Normal rank
Property / zbMATH Keywords
 
defective colour
Property / zbMATH Keywords: defective colour / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2350299420 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1604.07445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3118960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4056033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotics of the chromatic index for multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic index of multigraphs without large triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5203047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achieving maximum chromatic index in multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2822592 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph edge colouring: Tashkinov trees and Goldberg's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527280 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2016.03.025 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:44, 9 December 2024

scientific article
Language Label Description Also known as
English
On a limit of the method of Tashkinov trees for edge-colouring
scientific article

    Statements

    On a limit of the method of Tashkinov trees for edge-colouring (English)
    0 references
    0 references
    0 references
    20 June 2016
    0 references
    edge colouring
    0 references
    Goldberg-Seymour conjecture
    0 references
    multigraphs
    0 references
    Tashkinov tree
    0 references
    Kempe changes
    0 references
    defective colour
    0 references

    Identifiers