Add to ORKGConsider graphs that are embeddable in a surface of characteristic zero. Class two graphs of this type with maximum degree Δ ≤ 6 are known to exist. Hind and Zhao showed that such graphs with maximum degree Δ ≥ 8 must be class one. This article shows that such graphs with maximum degree Δ = 7 also must be class one, completing the analysis of these surfaces. These are the first surfaces where the maximum degree of class two graphs has been determined. © 2002 Elsevier Science (USA). All rights reserved
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...
The Δ-subgraph GΔ of a simple graph G is the subgraph of G induced by the vertices of maximum degree...
AbstractConsider graphs that are embeddable in a surface of characteristic zero. Class two graphs of...
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 A(G) ≥ (11+√49-24χ(Σ))/2, which is embe...
In this paper, we consider the problem of determining the maximum of the set of maximum degrees of c...
In this paper, we consider the problem of determining the maximum of the set of maximum degrees of c...
AbstractIt is known that there are class two graphs with Δ=6 which can be embedded in a surface Σ wi...
AbstractLet G be a graph embedded in a surface of characteristic zero with maximum degree Δ. The edg...
In this paper, we prove that any graph G with maximum degree Delta \u3e (*) over bar * (G) greater t...
AbstractA well-known conjecture of Vizing (the planar graph conjecture) states that every plane grap...
The paper shows that any graph G with the maximum degree Δ(G) ≥ 8, which is embeddable in a surface ...
In his paper, we discuss under what conditions graphs embedded in a surface Σ will be class one. © S...
The paper shows that any graph G with the maximum degree D(G) & 8, which is embeddable in a surf...
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...
The Δ-subgraph GΔ of a simple graph G is the subgraph of G induced by the vertices of maximum degree...
AbstractConsider graphs that are embeddable in a surface of characteristic zero. Class two graphs of...
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 A(G) ≥ (11+√49-24χ(Σ))/2, which is embe...
In this paper, we consider the problem of determining the maximum of the set of maximum degrees of c...
In this paper, we consider the problem of determining the maximum of the set of maximum degrees of c...
AbstractIt is known that there are class two graphs with Δ=6 which can be embedded in a surface Σ wi...
AbstractLet G be a graph embedded in a surface of characteristic zero with maximum degree Δ. The edg...
In this paper, we prove that any graph G with maximum degree Delta \u3e (*) over bar * (G) greater t...
AbstractA well-known conjecture of Vizing (the planar graph conjecture) states that every plane grap...
The paper shows that any graph G with the maximum degree Δ(G) ≥ 8, which is embeddable in a surface ...
In his paper, we discuss under what conditions graphs embedded in a surface Σ will be class one. © S...
The paper shows that any graph G with the maximum degree D(G) & 8, which is embeddable in a surf...
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...
The Δ-subgraph GΔ of a simple graph G is the subgraph of G induced by the vertices of maximum degree...