Subgraph Conditions for Hamiltonian Properties of Graphs

doi 10.3990/1.9789036534031
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

University Library/University of Twente

Related search

Hamiltonian Properties of Generalized Halin Graphs

Canadian Mathematical Bulletin
Mathematics
2009English

Minimum Degree and Size Conditions for Hamiltonian and Traceable Graphs

Fundamental Journal of Mathematics and Applications
2018English

Hamiltonian Properties of Graphs With Large Neighborhood Unions

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
1991English

PTAS for Densest K-Subgraph in Interval Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Variance of the Subgraph Count for Sparse Erdős–Rényi Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2010English

On Hamiltonian Line-Graphs

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1968English

Mining Frequent Subgraph Patterns From Uncertain Graphs

Ruan Jian Xue Bao/Journal of Software
Software
2009English

Incremental Frequent Subgraph Mining on Large Evolving Graphs

IEEE Transactions on Knowledge and Data Engineering
Computational TheoryComputer Science ApplicationsInformation SystemsMathematics
2017English

Finding Large Cycles in Hamiltonian Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy