Best monotone degree conditions for binding number and cycle structure
type: Item
instance of: scholarly article
title: Best monotone degree conditions for binding number and cycle structure
zbMATH Open document ID: 1320.05067
author: M. Yatauro
author: A. Nevo
author: D. Bauer
author: E. Schmeichel
author: Douglas R. Woodall
published in: Discrete Applied Mathematics
publication date: 2015-09-21T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C07
zbMATH DE Number: 6483954
zbMATH Keywords: toughness
zbMATH Keywords: binding number
zbMATH Keywords: cycle structure
zbMATH Keywords: degree sequence
zbMATH Keywords: best monotone
MaRDI profile type: Publication
full work available at URL: j.dam.2013.12.014
OpenAlex ID: W2045073432
cites work: Degree sequences and the existence of \(k\)-factors
cites work: Toughness and Vertex Degrees
cites work: Sufficient degree conditions fork-edge-connectedness of a graph
cites work: Best monotone degree conditions for binding number
cites work: Binding number, minimum degree, and cycle structure in graphs
cites work: The strongest monotone degree condition for \(n\)-connectedness of a graph
cites work: Q5576241
cites work: A method in graph theory
cites work: On Hamilton's ideals
cites work: Some Theorems on Abstract Graphs
cites work: Q5722819
cites work: The binding number of a graph and its Anderson number
cites work: A sufficient condition for Hamiltonian circuits
DOI: 10.1016/J.DAM.2013.12.014
Recommended article: Best monotone degree conditions for binding number
Recommended article: Q3615980
Recommended article: Q2971216
Recommended article: Best monotone degree conditions for graph properties: a survey
Recommended article: Minimum degree conditions for monochromatic cycle partitioning
Recommended article: An optimal binding number condition for bipancyclism
Recommended article: Binding number, minimum degree, and cycle structure in graphs
Recommended article: Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor
Recommended article: Monochromatic cycle partitions of graphs with large minimum degree
Recommended article: Binding number, minimum degree and bipancyclism in bipartite graphs
description: scientific article; zbMATH DE number 6483954