Pancyclicity in switching classes

DOI10.1016/S0020-0190(00)00020-XzbMath1338.68101OpenAlexW2057234453MaRDI QIDQ294726

Andrzej Ehrenfeucht, Jurriaan Hage, Grzegorz Rozenberg, Tero J.Harju

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S002001900000020X?np=y

zbMATH Keywords

computational complexitycombinatorial problemsHamiltonian graphspancyclic graphsswitching classes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Switching to Hedgehog-Free Graphs Is NP-Complete ⋮ On Switching to H‐Free Graphs ⋮ GETGRATS

Cites Work

• Biased graphs. I: Bias, balance, and gains
• Pancyclicity and NP-completeness in planar graphs
• Pancyclic graphs. I
• Dynamic labeled 2-structures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pancyclicity in switching classes