4 papers
math.CO2005
On 3-regular 4-ordered graphs
Karola Meszaros
A simple graph is \textit{k-ordered} (respectively, \textit{k-ordered hamiltonian}), if for any sequence of distinct vertices of there exists a cycle (r…
math.CO2005
On low degree k-ordered graphs
Karola Meszaros
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v_1, ..., v_k of G, there exists a cycle (respectively, a hamiltonia…
math.CO2005
Latin squares and their defining sets
Karola Meszaros
A Latin square is a square of order with its entries colored with colors so that all the entries in a row or column have different colors. Let be the m…
math.CO2005
On the number of genus one labeled circle trees
Karola Meszaros
A genus one labeled circle tree is a tree with its vertices on a circle, such that together they can be embedded in a surface of genus one, but not of genus zero. We define an e-re…