Vizing's theorem

Known as: Vizing planar graph conjecture, Vizing theorem, Vizing's planar graph conjecture

In graph theory, Vizing's theorem (named for Vadim G. Vizing who published it in 1964) states that the edges of every simple undirected graph may be…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

For each surface Σ, we define Δ(Σ)= max {Δ(G)| G is a class two graph of maximum degree Δ(G) that can be embedded in Σ} . Hence…

2015

Edwards, van den Heuvel, Kang, and Sereni conjectured the following strengthening of Vizing's Theorem: let $G$ be a simple graph…

2014

This paper has been withdrawn by the author. Peterson and Woodall previously proved that the list-edge-colouring conjecture holds…

2014

2005

Let G be a simple graph with n vertices and q edges,and maximum degree Δ. It is proved that the domination number γ of G…

2004

Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex…

2002

For a graph H with maximal degree A(H) Vizing's Theorem tells us that the chromatic index x ' (H) satisfies A(H) <~ x ' (H) ~< A…

1999

The classical Vizing's edge colouring theorem states that for a loopless multigraph G of multiplicity μ and of maximum degree…

1999

Galvin ([7]) proved that every k-edge-colorable bipartite multigraph is kedge-choosable. Slivnik ([11]) gave a streamlined proof…

1997

Vizing's theorem states that the chromatic index 0 (G) of a graph G is either the maximum degree (G) or (G) + 1. A graph G is…