Hamiltonian Properties of Graphs With Large Neighborhood Unions

Discrete Mathematics - Netherlands
doi 10.1016/0012-365x(91)90468-h
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Long Dominating Cycles and Paths in Graphs With Large Neighborhood Unions

Journal of Graph Theory
GeometryTopology
1991English

Finding Large Cycles in Hamiltonian Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2010English

Hamiltonian Properties of Generalized Halin Graphs

Canadian Mathematical Bulletin
Mathematics
2009English

Subgraph Conditions for Hamiltonian Properties of Graphs

English

Constructing Arbitrarily Large Graphs With a Specified Number of Hamiltonian Cycles

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

Construction of Barnette Graphs Whose Large Subgraphs Are Non-Hamiltonian

Acta Universitatis Sapientiae, Mathematica
Mathematics
2019English

On Hamiltonian Line-Graphs

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1968English

Directed Graphs as Unions of Partial Orders

Pacific Journal of Mathematics
Mathematics
1971English

Large Neighborhood Search

International Series in Operations Research and Management Science
ManagementApplied MathematicsStrategyManagement ScienceComputer Science ApplicationsOperations ResearchSoftware
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy