AbstractWe introduce a signed version of the diagonal flip operation. We then formulate the conjecture that any two triangulations of a given polygon may be transformed into one another by a signable sequence of diagonal flips. Finally, we show that this conjecture, if true, would imply the four color theorem
We show that any combinatorial triangulation on n vertices can be transformed into a 4-connected one...
This paper studied the geometric and combinatorial aspects of the classical Lawson's flip algorithm ...
This paper studied the geometric and combinatorial aspects of the classical Lawsons flip algorithm [...
AbstractEliahou (1999) [1] and Kryuchkov (1992) [3] conjectured a proposition that Gravier and Payan...
AbstractIn this paper, we prove that any two triangulations of a given polygon may be transformed in...
AbstractLet σ1,σ2 be two permutations in the symmetric group Sn. Among the many sequences of element...
AbstractIt will be shown that any two triangulations of a closed surface can be transformed into eac...
Simultaneous diagonal flips in plane triangulations are investigated. It is proved that every triang...
AbstractA diagonal flip is an operation that converts one triangulation of a convex polygon into ano...
Given a triangulation of a point set in the plane, a flip deletes an edge e whose removal leaves a c...
Given a triangulation of a point set in the plane, a flip deletes an edge e whose removal leaves a c...
AbstractIt will be shown that any two triangulations on a closed surface, except the sphere, with mi...
Given a triangulation of a point set in the plane, a flip deletes an edge e whose removal leaves a c...
AbstractIn this paper, we shall prove that any two triangulations on the projective plane with n ver...
Given two combinatorial triangulations, how many edge flips are necessary and sufficient to convert ...
We show that any combinatorial triangulation on n vertices can be transformed into a 4-connected one...
This paper studied the geometric and combinatorial aspects of the classical Lawson's flip algorithm ...
This paper studied the geometric and combinatorial aspects of the classical Lawsons flip algorithm [...
AbstractEliahou (1999) [1] and Kryuchkov (1992) [3] conjectured a proposition that Gravier and Payan...
AbstractIn this paper, we prove that any two triangulations of a given polygon may be transformed in...
AbstractLet σ1,σ2 be two permutations in the symmetric group Sn. Among the many sequences of element...
AbstractIt will be shown that any two triangulations of a closed surface can be transformed into eac...
Simultaneous diagonal flips in plane triangulations are investigated. It is proved that every triang...
AbstractA diagonal flip is an operation that converts one triangulation of a convex polygon into ano...
Given a triangulation of a point set in the plane, a flip deletes an edge e whose removal leaves a c...
Given a triangulation of a point set in the plane, a flip deletes an edge e whose removal leaves a c...
AbstractIt will be shown that any two triangulations on a closed surface, except the sphere, with mi...
Given a triangulation of a point set in the plane, a flip deletes an edge e whose removal leaves a c...
AbstractIn this paper, we shall prove that any two triangulations on the projective plane with n ver...
Given two combinatorial triangulations, how many edge flips are necessary and sufficient to convert ...
We show that any combinatorial triangulation on n vertices can be transformed into a 4-connected one...
This paper studied the geometric and combinatorial aspects of the classical Lawson's flip algorithm ...
This paper studied the geometric and combinatorial aspects of the classical Lawsons flip algorithm [...
DOI
Add to ORKG