Vizing's coloring algorithm and the fan number (Q3055930): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/jgt.20469 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4251537409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On edge-colorings of graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical star multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Vizing's adjacency lemma of edge chromatic critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the colouring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3118960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über eine von H. S. WILF angegebene Schranke für die chromatische Zahl endlicher Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-coloring of multigraphs: Recoloring technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note concerning the chromatic index of multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better than “best possible” algorithm to edge color multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-coloring of multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the $1.1$ Edge-Coloring of Multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Isomorphs of the Four-Colour Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs of maximum degree seven are Class I / 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 Vizing's bound for the chromatic index of a multigraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Coloring the Lines of a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME UNSOLVED PROBLEMS IN GRAPH THEORY / rank
 
Normal rank

Latest revision as of 11:38, 3 July 2024

scientific article
Language Label Description Also known as
English
Vizing's coloring algorithm and the fan number
scientific article

    Statements

    Vizing's coloring algorithm and the fan number (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2010
    0 references
    0 references
    chromatic index
    0 references
    edge coloring
    0 references
    0 references