Finding Large Cycles in Hamiltonian Graphs

Discrete Applied Mathematics - Netherlands
doi 10.1016/j.dam.2009.12.006
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Constructing Arbitrarily Large Graphs With a Specified Number of Hamiltonian Cycles

Electronic Journal of Graph Theory and Applications
CombinatoricsApplied MathematicsDiscrete Mathematics
2016English

Finding Cycles With Topological Properties in Embedded Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2011English

Finding Structures in Large-Scale Graphs

2012English

Directed and Antidirected Hamiltonian Cycles and Paths in Bipartite Graphs

Banach Center Publications
1989English

Cycles in Graphs With Large Independence Ratio

Journal of Combinatorics
2011English

Hamiltonian Properties of Graphs With Large Neighborhood Unions

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
1991English

Construction of Barnette Graphs Whose Large Subgraphs Are Non-Hamiltonian

Acta Universitatis Sapientiae, Mathematica
Mathematics
2019English

Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Long Dominating Cycles and Paths in Graphs With Large Neighborhood Unions

Journal of Graph Theory
GeometryTopology
1991English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy