On the existence of a cycle of length at least 7 in a (1,≤ 2)-twin-free graph

DOI10.7151/dmgt.1516zbMath1217.05116OpenAlexW2059512052MaRDI QIDQ2997586

Olivier Hudry, David Auger, Irène Charon, Antoine C. Lobstein

Publication date: 9 May 2011

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/b138dc94b77e25e4a158352fc56d9fefac295ae8

zbMATH Keywords

undirected graphidentifying codeidentifiable graphdistinguishable graphmaximum length cycletwin subsets

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75)