Edge-colouring of joins of regular graphs. I (Q849137): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-009-9235-8 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-009-9235-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3021046945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic index of graphs of even order with many edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-colouring of join graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-colouring of regular graphs of large degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-colouring of joins of regular graphs. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Investigations on an edge coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic index of complete multipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Solution of a Timetabling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCHEDULING FILE TRANSFERS UNDER PORT AND CHANNEL CONSTRAINTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to find overfull subgraphs in graphs with large maximum degree. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Minimum Cut-Sets and <i>b</i>-Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge coloring regular graphs of high degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic index of graphs with a spanning star / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-009-9235-8 / rank
 
Normal rank

Latest revision as of 05:10, 10 December 2024

scientific article
Language Label Description Also known as
English
Edge-colouring of joins of regular graphs. I
scientific article

    Statements

    Edge-colouring of joins of regular graphs. I (English)
    0 references
    0 references
    0 references
    24 February 2010
    0 references
    edge-colouring
    0 references
    join
    0 references
    regular graph
    0 references

    Identifiers