Binding number, minimum degree, and cycle structure in graphs

DOI10.1002/JGT.21633zbMATH Open1248.05105OpenAlexW1596232059MaRDI QIDQ2911065FDOQ2911065

Authors: E. Schmeichel, D. Bauer 

Publication date: 12 September 2012

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21633

zbMATH Keywords

cycle structurebinding number

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Cites Work

• Graph theory with applications
• Some Theorems on Abstract Graphs
• The binding number of a graph and its Anderson number
• Long cycles in graphs with large degree sums
• A sufficient condition for Hamiltonian circuits
• The binding number of a graph and its pancyclism
• Title not available (Why is that?)
• The binding number of a graph and its triangle
• Binding number and minimum degree for k-factors
• A note on maximal triangle‐free graphs
• A note on dominating cycles in 2-connected graphs

Cited In (6)

• Recent advances on the Hamiltonian problem: survey III
• Binding number, \(k\)-factor and spectral radius of graphs
• Best monotone degree conditions for graph properties: a survey
• Binding number, odd \([1, b]\)-factors and the distance spectral radius
• Binding number, minimum degree and bipancyclism in bipartite graphs
• Best monotone degree conditions for binding number and cycle structure

This page was built for publication: Binding number, minimum degree, and cycle structure in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2911065)