DOIAbstract
In his paper, we discuss under what conditions graphs embedded in a surface Σ will be class one. © Springer-Verlag 2000
In his paper, we discuss under what conditions graphs embedded in a surface Σ will be class one. © Springer-Verlag 2000
The paper shows that any graph G with the maximum degree D(G) & 8, which is embeddable in a surf...
A (1, λ)-embedded graph is a graph that can be embedded on a surface with Euler characteristic λ so ...
The edge chromatic number of G is the minimum number of colors required to color the edges of G in s...
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 prove that any graph G with maximum degree Delta \u3e (*) over bar * (G) greater t...
Consider graphs that are embeddable in a surface of characteristic zero. Class two graphs of this ty...
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...
AbstractLet G be a graph embedded in a surface of characteristic zero with maximum degree Δ. The edg...
In this article, we show that there exists an integer k(Sigma) greater than or equal to 5 such that,...
AbstractIt is known that there are class two graphs with Δ=6 which can be embedded in a surface Σ wi...
A total-k-coloring of a graph G is a coloring of V ∪ E using k colors such that no two adjacent or i...
AbstractEvery graph embedded on a surface of positive genus with every face bounded by an even numbe...
AbstractLet G be a graph. The core of G, denoted by GΔ, is the subgraph of G induced by the vertices...
The paper shows that any graph G with the maximum degree Δ(G) ≥ 8, which is embeddable in a surface ...
The paper shows that any graph G with the maximum degree D(G) & 8, which is embeddable in a surf...
A (1, λ)-embedded graph is a graph that can be embedded on a surface with Euler characteristic λ so ...
The edge chromatic number of G is the minimum number of colors required to color the edges of G in s...
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 prove that any graph G with maximum degree Delta \u3e (*) over bar * (G) greater t...
Consider graphs that are embeddable in a surface of characteristic zero. Class two graphs of this ty...
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...
AbstractLet G be a graph embedded in a surface of characteristic zero with maximum degree Δ. The edg...
In this article, we show that there exists an integer k(Sigma) greater than or equal to 5 such that,...
AbstractIt is known that there are class two graphs with Δ=6 which can be embedded in a surface Σ wi...
A total-k-coloring of a graph G is a coloring of V ∪ E using k colors such that no two adjacent or i...
AbstractEvery graph embedded on a surface of positive genus with every face bounded by an even numbe...
AbstractLet G be a graph. The core of G, denoted by GΔ, is the subgraph of G induced by the vertices...
The paper shows that any graph G with the maximum degree Δ(G) ≥ 8, which is embeddable in a surface ...
The paper shows that any graph G with the maximum degree D(G) & 8, which is embeddable in a surf...
A (1, λ)-embedded graph is a graph that can be embedded on a surface with Euler characteristic λ so ...
The edge chromatic number of G is the minimum number of colors required to color the edges of G in s...
Add to ORKG