Pancyclicity in switching classes

DOI10.1016/S0020-0190(00)00020-XMaRDI QIDQ294726zbMATH OpenOpenAlexFDO

Authors Andrzej Ehrenfeucht, Jurriaan Hage, Grzegorz Rozenberg, Tero 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

combinatorial problemscomputational complexityHamiltonian graphspancyclic graphsswitching classes

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2097774
• scientific article; zbMATH DE number 4057569
• On perfect switching classes
• scientific article; zbMATH DE number 2016073
• On perfect switching classes

Cites work

• Biased graphs. I: Bias, balance, and gains
• Dynamic labeled 2-structures
• Graph theory
• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• scientific article; zbMATH DE number 3745240 (Why is no real title available?)
• scientific article; zbMATH DE number 107643 (Why is no real title available?)
• scientific article; zbMATH DE number 125469 (Why is no real title available?)
• scientific article; zbMATH DE number 3547309 (Why is no real title available?)
• scientific article; zbMATH DE number 3225111 (Why is no real title available?)
• Pancyclic graphs. I
• Pancyclicity and NP-completeness in planar graphs

Cited in

(4)

• Switching to hedgehog-free graphs is NP-complete
• scientific article; zbMATH DE number 2097774 (Why is no real title available?)
• GETGRATS: a summary of scientific results (with annotated bibliography)
• On Switching to H‐Free Graphs

This page was built for publication: Pancyclicity in switching classes

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