Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results
A. Benkouar, Y. Manoussakis, V. Th. Paschos, R. Saad (1996)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Displaying similar documents to “On the parallel complexity of the alternating hamiltonian cycle problem”
Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results
Minimal cycle bases of outerplanar graphs.
Leydold, Josef, Stadler, Peter F. (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Knotted Hamiltonian cycles in spatial embeddings of complete graphs.
Blain, Paul, Bowlin, Garry, Foisy, Joel, Hendricks, Jacob, LaCombe, Jason (2007)
The New York Journal of Mathematics [electronic only]
Similarity:
On bicritical snarks
Eckhard Steffen (2001)
Mathematica Slovaca
Similarity:
On -Pancyclic Graphs
Vasil Jacoš (1975)
Matematický časopis
Similarity:
A problem concerning -pancyclic graphs
Vasil Jacoš, Stanislav Jendroľ (1974)
Matematický časopis
Similarity: