Solution of the Hamiltonian problem for self-complementary graphs

DOI10.1016/0095-8956(79)90065-0MaRDI QIDQ1257490zbMATH OpenOpenAlexFDO

Authors S. B. 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

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

Cites work

• scientific article; zbMATH DE number 3425637 (Why is no real title available?)
• scientific article; zbMATH DE number 3226832 (Why is no real title available?)
• scientific article; zbMATH DE number 3303831 (Why is no real title available?)
• scientific article; zbMATH DE number 3377257 (Why is no real title available?)
• scientific article; zbMATH DE number 3194323 (Why is no real title available?)
• Algorithms for constructing graphs and digraphs with given valences and factors
• Characterization of self-complementary graphs with 2-factors
• Cycles in self-complementary graphs
• Hamiltonian arcs in self-complementary graphs
• On factorable degree sequences
• Selbstkomplementäre Graphen
• Sequences with a unique realization by simple graphs
• The k-factor conjecture is true

Cited in

(7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1257490)