On the elusiveness of Hamiltonian property

DOI10.1007/BF02669693zbMath0979.05070OpenAlexW2005852719MaRDI QIDQ5931908

Sui-Xiang Gao

Publication date: 17 February 2002

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02669693

zbMATH Keywords

elusivenessgraph propertyHamiltonian property

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge disjoint placement of graphs
• A lower bound for the recognition of digraph properties
• A topological approach to evasiveness
• Some results on the complexity of families of sets
• Complete subgraphs are elusive
• On recognizing graph properties from adjacency matrices
• Packings of graphs and applications to computational complexity
• The Rivest-Vuillemin conjecture on monotone Boolean functions is true for ten variables
• Decision tree complexity of graph properties with dimension at most 5
• On the recognition complexity of some graph properties
• Nontrivial monotone weakly symmetric Boolean functions with six variables are elusive
• Monotone Bipartite Graph Properties are Evasive
• CREW PRAM<scp>s</scp> and Decision Trees
• Some Results on Elusive Graph Properties
• On the time required to detect cycles and connectivity in graphs

This page was built for publication: On the elusiveness of Hamiltonian property