Distinguishing graphs via cycles
From MaRDI portal
Publication:2695304
DOI10.1007/978-3-030-89543-3_33OpenAlexW3208505826MaRDI QIDQ2695304
Publication date: 30 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-89543-3_33
Cites Work
- Unnamed Item
- Unnamed Item
- Cubic vertex-transitive non-Cayley graphs of order \(8p\)
- On automorphisms and structural properties of double generalized Petersen graphs
- \((0,\lambda)\)-graphs and \(n\)-cubes
- Determining number of generalized and double generalized Petersen graph
- The classification of distance-regular graphs of type IIB
- NP-hardness of the recognition of coordinated graphs
- Finite primitive distance-transitive graphs
- String graphs. II: Recognizing string graphs is NP-hard
- Unit disk graph recognition is NP-hard
- Hamilton cycles in double generalized Petersen graphs
- Isomorphism checking of \(I\)-graphs
- Recognizing generalized Petersen graphs in linear time
- Cycle-regular graphs
- Cubic bi-Cayley graphs over abelian groups
- Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
- Cycles in folded hypercubes
- Some other algebraic properties of folded hypercubes
- Clique Graph Recognition Is NP-Complete
- Enumeration of I-graphs: Burnside does it again
- SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY
- On the uniqueness of a certain thin near octagon (or partial 2-geometry, or parallelism) derived from the binary Golay code
- A theorem on tait colorings with an application to the generalized Petersen graphs
- I-graphs and the corresponding configurations
- Self-dual configurations and regular graphs
- Cycle regular graphs need not be transitive
- Canonical double covers of generalized Petersen graphs, and double generalized Petersen graphs
