Graphs whose complement and square are isomorphic
From MaRDI portal
Publication:2449164
DOI10.1016/j.disc.2014.03.018zbMath1288.05182OpenAlexW2078843410MaRDI QIDQ2449164
Daniel Pellicer, Martin Milanič, Gabriel Verret, Anders Sune Pedersen
Publication date: 6 May 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.03.018
Related Items
On self-clique graphs with triangular cliques, Searching for square-complementary graphs: complexity of recognition and further nonexistence results
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A short proof of the versatile version of Fleischner's theorem
- On antipodal graphs
- r-partite self-complementary graphs-diameters
- Complement reducible graphs
- Further results on graph equations for line graphs and \(n\)-th power graphs
- Characterisation of potentially bipartite self-complementary bipartitioned sequences
- On powers of \(m\)-trapezoid graphs
- The square of every two-connected graph is Hamiltonian
- Selbstkomplementäre Graphen
- A graph and its complement with specified properties. IV. Counting self-complementary blocks
- Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
- On Comparability and Permutation Graphs
- On testing isomorphism of permutation graphs
- Efficient Planarity Testing
- Graph Classes: A Survey
- A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
- Isomorph-Free Exhaustive Generation
- A solution of the isomorphism problem for circulant graphs
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Enumeration of bipartite self-complementary graphs
- On self-antipodal graphs
