Some applications of Vizing's theorem to vertex colorings of graphs (Q1839256): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Q200923 / rank
Normal rank
 
Property / author
 
Property / author: Henry A. Kierstead / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On edge-colorings of graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5570136 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CHROMATIC BOUNDS FOR A CLASS OF GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Choudum's “chromatic bounds for a class of graphs” / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Coloring the Lines of a Network / rank
 
Normal rank

Latest revision as of 18:48, 13 June 2024

scientific article
Language Label Description Also known as
English
Some applications of Vizing's theorem to vertex colorings of graphs
scientific article

    Statements

    Some applications of Vizing's theorem to vertex colorings of graphs (English)
    0 references
    0 references
    0 references
    1983
    0 references
    0 references
    edge critical multigraph
    0 references
    chromatic number
    0 references
    chromatic index
    0 references
    maximal clique
    0 references
    maximal degree
    0 references