For each surface Sigma, we define Delta(Sigma)= max{Delta(G)|G is a class two graph of maximum degree Delta(G) that can be embedded in Sigma}. Hence, Vizing\u27s Planar Graph Conjecture can be restated as Delta(Sigma) = 5 if Sigma is a plane. In this paper, we show that Delta(Sigma)= 9 if Sigma is a surface of characteristic chi(Sigma) = -5. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 68: 148-168, 201
AbstractIt is known that there are class two graphs with Δ=6 which can be embedded in a surface Σ wi...
In 1968, Vizing [Uaspekhi Mat Nauk 23 (1968) 117-134; Russian Math Surveys 23 (1968), 125-142] conje...
AbstractA well-known conjecture of Vizing (the planar graph conjecture) states that every plane grap...
In this paper, we consider the problem of determining the maximum of the set of maximum degrees of c...
For each surface Σ , we define Δ (Σ) = max{Δ(G)|G is a class two graph with maximum degree Δ (G) tha...
For each surface Σ, we define (Formula presented.) max (Formula presented.) G is a class two graph o...
In this paper, we consider the problem of determining the maximum of the set of maximum degrees of c...
Consider graphs that are embeddable in a surface of characteristic zero. Class two graphs of this ty...
In this paper, we prove that any graph G with maximum degree Delta \u3e (*) over bar * (G) greater t...
AbstractIn 1965, Vizing proved that planar graphs of maximum degree at least eight have the edge chr...
Consider graphs that are embeddable in a surface of characteristic zero. Class two graphs of this ty...
In 1965, Vizing proved that planar graphs of maximum degree at least eight have the edge chromatic n...
In 1965, Vizing proved that planar graphs of maximum degree at least eight have the edge chromatic n...
AbstractConsider graphs that are embeddable in a surface of characteristic zero. Class two graphs of...
We give a short proof of the following theorem due to Borodin~\cite{Bor90}. Every planar graph with ...
AbstractIt is known that there are class two graphs with Δ=6 which can be embedded in a surface Σ wi...
In 1968, Vizing [Uaspekhi Mat Nauk 23 (1968) 117-134; Russian Math Surveys 23 (1968), 125-142] conje...
AbstractA well-known conjecture of Vizing (the planar graph conjecture) states that every plane grap...
In this paper, we consider the problem of determining the maximum of the set of maximum degrees of c...
For each surface Σ , we define Δ (Σ) = max{Δ(G)|G is a class two graph with maximum degree Δ (G) tha...
For each surface Σ, we define (Formula presented.) max (Formula presented.) G is a class two graph o...
In this paper, we consider the problem of determining the maximum of the set of maximum degrees of c...
Consider graphs that are embeddable in a surface of characteristic zero. Class two graphs of this ty...
In this paper, we prove that any graph G with maximum degree Delta \u3e (*) over bar * (G) greater t...
AbstractIn 1965, Vizing proved that planar graphs of maximum degree at least eight have the edge chr...
Consider graphs that are embeddable in a surface of characteristic zero. Class two graphs of this ty...
In 1965, Vizing proved that planar graphs of maximum degree at least eight have the edge chromatic n...
In 1965, Vizing proved that planar graphs of maximum degree at least eight have the edge chromatic n...
AbstractConsider graphs that are embeddable in a surface of characteristic zero. Class two graphs of...
We give a short proof of the following theorem due to Borodin~\cite{Bor90}. Every planar graph with ...
AbstractIt is known that there are class two graphs with Δ=6 which can be embedded in a surface Σ wi...
In 1968, Vizing [Uaspekhi Mat Nauk 23 (1968) 117-134; Russian Math Surveys 23 (1968), 125-142] conje...
AbstractA well-known conjecture of Vizing (the planar graph conjecture) states that every plane grap...