Solution of the Hamiltonian problem for self-complementary graphs

DOI10.1016/0095-8956(79)90065-0zbMath0406.05047OpenAlexW2059599164MaRDI QIDQ1257490

Siddani Bhaskara Rao

Publication date: 1979

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(79)90065-0

zbMATH Keywords

Hamiltonian cyclepancyclicSelf-complementary Graph

Mathematics Subject Classification ID

Graph theory (05C99) Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

The number of open chains of length three and the parity of the number of open chains of length k in self-complementary graphs ⋮ Forcibly bipartite and acyclic (uni-)graphic sequences ⋮ Alternating Eulerian trails with prescribed degrees in two edge-colored complete graphs ⋮ On regular and strongly-regular self-complementary graphs ⋮ Characterization of self-complementary graphs with 2-factors ⋮ On forcibly hereditary P-graphical sequences ⋮ Hamiltonian-connected self-complementary graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sequences with a unique realization by simple graphs
• Cycles in self-complementary graphs
• Characterization of self-complementary graphs with 2-factors
• The k-factor conjecture is true
• Hamiltonian arcs in self-complementary graphs
• On factorable degree sequences
• Algorithms for constructing graphs and digraphs with given valences and factors
• Selbstkomplementäre Graphen

This page was built for publication: Solution of the Hamiltonian problem for self-complementary graphs