A new tool for proving Vizing's theorem (Q2449145): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On edge-colorings of graphs. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new method of proving theorems on chromatic index / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3048873 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Edge-coloring of multigraphs: Recoloring technique / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3118960 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5558480 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5550921 / rank | |||
Normal rank |
Latest revision as of 12:28, 8 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new tool for proving Vizing's theorem |
scientific article |
Statements
A new tool for proving Vizing's theorem (English)
0 references
6 May 2014
0 references
edge coloring
0 references
critical graphs
0 references
adjacency lemma
0 references