Minimum Degree and Size Conditions for Hamiltonian and Traceable Graphs

Fundamental Journal of Mathematics and Applications
doi 10.33401/fujma.450809
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Fundamental Journal of Mathematics and Applications

Related search

Subgraph Conditions for Hamiltonian Properties of Graphs

English

BINDING NUMBER AND MINIMUM DEGREE FOR FRACTIONAL (K,m)-Deleted GRAPHS

Bulletin of the Australian Mathematical Society
Mathematics
2011English

Hamiltonian Decomposition of Cayley Graphs of Degree 4

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
1989English

P_m-Saturated Bipartite Graphs With Minimum Size

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2004English

Optimal Pebbling Number of Graphs With Given Minimum Degree

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Distant Sum Distinguishing Index of Graphs With Bounded Minimum Degree

Ars Mathematica Contemporanea
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTheoretical Computer ScienceTopology
2019English

Sparse Universal Graphs for Bounded-Degree Graphs

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2007English

On Hamiltonian Line-Graphs

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1968English

Minimum Degree, Leaf Number and Traceability

Czechoslovak Mathematical Journal
Mathematics
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy