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

DOI10.7151/DMGT.1516MaRDI QIDQ2997586zbMATH OpenOpenAlexFDO

Authors David Auger, Irène Charon, Olivier Hudry, Antoine 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)

Recommendations

• scientific article; zbMATH DE number 1117463
• The longest cycles in a graph G with minimum degree at least \(| G| /k\)
• Relative length of longest paths and longest cycles in triangle-free graphs
• Extremal values for identification, domination and maximum cliques in twin-free graphs.
• Graphs without cycles of even length

Cited in

(1)

• Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs

This page was built for publication: On the existence of a cycle of length at least 7 in a \((1,\leq 2)\)-twin-free graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2997586)