AbstractEvery triangulation of the orientable surface of genus g with no noncontractible cycle of length less than 23g + 4 contains a spanning tree of maximum degree at most four
AbstractLet T be a tree and m be a positive integer. The leaf degree of a vertex x∈V(G) is defined a...
International audienceWe prove that any triangulation of a surface different from the sphere and the...
Let R and B be two disjoint sets of points in the plane such that | B| ≤ | R| , and no three points ...
AbstractEvery triangulation of the orientable surface of genus g with no noncontractible cycle of le...
AbstractThomassen has recently shown that a triangulation of the orientable surface of genus g has a...
AbstractThomassen has recently shown that a triangulation of the orientable surface of genus g has a...
AbstractIn this paper we show that for eachnthere is a triangulation of an orientable surface which ...
We study a well known characterization of planar graphs, also called Schnyder wood or Schnyder label...
AbstractIn this paper we show that for eachnthere is a triangulation of an orientable surface which ...
This paper considers the conjecture by Grünbaum that every planar 3-connected graph has a spanning ...
AbstractProblem 50 in the Open Problems Project of the computational geometry community asks whether...
AbstractWe identify three mutually nonisomorphic triangulations of the closed orientable surface of ...
Let R and B be two disjoint sets of points in the plane such that |B| ≤ |R|, and no three points of ...
AbstractAn Euler characteristic argument indicates that if K, a girth three graph, triangulates the ...
A triangulation of a surface is irreducible if there is no edge whose contraction produces another t...
AbstractLet T be a tree and m be a positive integer. The leaf degree of a vertex x∈V(G) is defined a...
International audienceWe prove that any triangulation of a surface different from the sphere and the...
Let R and B be two disjoint sets of points in the plane such that | B| ≤ | R| , and no three points ...
AbstractEvery triangulation of the orientable surface of genus g with no noncontractible cycle of le...
AbstractThomassen has recently shown that a triangulation of the orientable surface of genus g has a...
AbstractThomassen has recently shown that a triangulation of the orientable surface of genus g has a...
AbstractIn this paper we show that for eachnthere is a triangulation of an orientable surface which ...
We study a well known characterization of planar graphs, also called Schnyder wood or Schnyder label...
AbstractIn this paper we show that for eachnthere is a triangulation of an orientable surface which ...
This paper considers the conjecture by Grünbaum that every planar 3-connected graph has a spanning ...
AbstractProblem 50 in the Open Problems Project of the computational geometry community asks whether...
AbstractWe identify three mutually nonisomorphic triangulations of the closed orientable surface of ...
Let R and B be two disjoint sets of points in the plane such that |B| ≤ |R|, and no three points of ...
AbstractAn Euler characteristic argument indicates that if K, a girth three graph, triangulates the ...
A triangulation of a surface is irreducible if there is no edge whose contraction produces another t...
AbstractLet T be a tree and m be a positive integer. The leaf degree of a vertex x∈V(G) is defined a...
International audienceWe prove that any triangulation of a surface different from the sphere and the...
Let R and B be two disjoint sets of points in the plane such that | B| ≤ | R| , and no three points ...
DOI
Add to ORKG