Characterization of self-complementary graphs with 2-factors
From MaRDI portal
Publication:1238818
DOI10.1016/0012-365X(77)90157-1zbMath0359.05029MaRDI QIDQ1238818
Publication date: 1977
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (5)
Forcibly bipartite and acyclic (uni-)graphic sequences ⋮ Some results on generalized self-complementary graphs ⋮ Alternating Eulerian trails with prescribed degrees in two edge-colored complete graphs ⋮ Graphs and degree sequences. I ⋮ Solution of the Hamiltonian problem for self-complementary graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Sequences with a unique realization by simple graphs
- The degree sequences of self-complementary graphs
- Cycles in self-complementary graphs
- Solution of the Hamiltonian problem for self-complementary graphs
- Parallel concepts in graph theory
- The k-factor conjecture is true
- Spanning subgraphs with specified valencies
- Hamiltonian arcs in self-complementary graphs
- On factorable degree sequences
- Algorithms for constructing graphs and digraphs with given valences and factors
- Selbstkomplementäre Graphen
- A Short Proof of the Factor Theorem for Finite Graphs
- Self-complementary graphs
This page was built for publication: Characterization of self-complementary graphs with 2-factors