Distinguishing graphs via cycles (Q2695304)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Distinguishing graphs via cycles	scientific article

Statements

scholarly article

0 references

Distinguishing graphs via cycles (English)

0 references

0 references

0 references

publication date

30 March 2023

0 references

zbMATH Keywords

recognition algorithm

0 references

generalized Petersen graphs

0 references

double generalized Petersen graph

0 references

folded cubes

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-89543-3_33

0 references

Clique Graph Recognition Is NP-Complete

0 references

I-graphs and the corresponding configurations

0 references

Finite primitive distance-transitive graphs

0 references

Unit disk graph recognition is NP-hard

0 references

On the uniqueness of a certain thin near octagon (or partial 2-geometry, or parallelism) derived from the binary Golay code

0 references

0 references

Self-dual configurations and regular graphs

0 references

Determining number of generalized and double generalized Petersen graph

0 references

SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY

0 references

Cycle regular graphs need not be transitive

0 references

Isomorphism checking of \(I\)-graphs

0 references

Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes

0 references

String graphs. II: Recognizing string graphs is NP-hard

0 references

Recognizing generalized Petersen graphs in linear time

0 references

On automorphisms and structural properties of double generalized Petersen graphs

0 references

Some other algebraic properties of folded hypercubes

0 references

Cycle-regular graphs

0 references

\((0,\lambda)\)-graphs and \(n\)-cubes

0 references

Enumeration of I-graphs: Burnside does it again

0 references

Canonical double covers of generalized Petersen graphs, and double generalized Petersen graphs

0 references

Hamilton cycles in double generalized Petersen graphs

0 references

NP-hardness of the recognition of coordinated graphs

0 references

The classification of distance-regular graphs of type IIB

0 references

A theorem on tait colorings with an application to the generalized Petersen graphs

0 references

Cycles in folded hypercubes

0 references

0 references

Cubic vertex-transitive non-Cayley graphs of order \(8p\)

0 references

Cubic bi-Cayley graphs over abelian groups

0 references

Identifiers

10.1007/978-3-030-89543-3_33

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2695304

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2695304&oldid=37503649"