AbstractWe show that for every orientable surface Σ there is a number c so that every Eulerian triangulation of Σ with representativeness ⩾c is 4-colourable
In 1973, Altshuler characterized the $6$-regular triangulations on the torus to be precisely those t...
AbstractThe main result of this paper is a theorem concerning possible cubic maps on the plane or sp...
A Grunbaum coloring of a triangulation G is a map c : E(G){1,2,3} such that for each face f of G, th...
AbstractWe show that for every orientable surface Σ there is a number c so that every Eulerian trian...
Using the existence of noncrossing Eulerian circuits in Eulerian plane graphs, we give a short const...
AbstractA triangulation is said to be even if each vertex has even degree. It is known that every ev...
AbstractA triangulation is said to be even if each vertex has even degree. It is known that every ev...
M.Sc.Within the field of Graph Theory the many ways in which graphs can be coloured have received a ...
AbstractIt is proved that there is a function f:N→N such that the following holds. Let G be a graph ...
In order to study the parity of a k-colouring, Tutte introduced the notion of a k-colouring complex ...
AbstractWe show that Grötzschʼs theorem extends to all higher surfaces in the sense that every trian...
AbstractGiven an orientable or nonorientable closed surface S and an integer n not less than 3 and n...
AbstractAn Euler characteristic argument indicates that if K, a girth three graph, triangulates the ...
AbstractIn this note, we show that every 5-connected triangulation in a surface with sufficiently la...
We show that an Eulerian triangulation of the Klein bottle has chromatic number equal to six if and ...
In 1973, Altshuler characterized the $6$-regular triangulations on the torus to be precisely those t...
AbstractThe main result of this paper is a theorem concerning possible cubic maps on the plane or sp...
A Grunbaum coloring of a triangulation G is a map c : E(G){1,2,3} such that for each face f of G, th...
AbstractWe show that for every orientable surface Σ there is a number c so that every Eulerian trian...
Using the existence of noncrossing Eulerian circuits in Eulerian plane graphs, we give a short const...
AbstractA triangulation is said to be even if each vertex has even degree. It is known that every ev...
AbstractA triangulation is said to be even if each vertex has even degree. It is known that every ev...
M.Sc.Within the field of Graph Theory the many ways in which graphs can be coloured have received a ...
AbstractIt is proved that there is a function f:N→N such that the following holds. Let G be a graph ...
In order to study the parity of a k-colouring, Tutte introduced the notion of a k-colouring complex ...
AbstractWe show that Grötzschʼs theorem extends to all higher surfaces in the sense that every trian...
AbstractGiven an orientable or nonorientable closed surface S and an integer n not less than 3 and n...
AbstractAn Euler characteristic argument indicates that if K, a girth three graph, triangulates the ...
AbstractIn this note, we show that every 5-connected triangulation in a surface with sufficiently la...
We show that an Eulerian triangulation of the Klein bottle has chromatic number equal to six if and ...
In 1973, Altshuler characterized the $6$-regular triangulations on the torus to be precisely those t...
AbstractThe main result of this paper is a theorem concerning possible cubic maps on the plane or sp...
A Grunbaum coloring of a triangulation G is a map c : E(G){1,2,3} such that for each face f of G, th...
DOI
Add to ORKG