Binding number, cycles, and cliques

DOI10.1007/978-3-319-97686-0_3MaRDI QIDQ5378295zbMATHOpenAlexFDO

Authors Wayne Goddard

Publication date 12 June 2019

Published in Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-97686-0_3

zbMATH Keywords

Hamiltonian graphpancyclic graphbinding number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Recommendations

• The binding number of a graph and its pancyclism
• The binding number of a graph and its triangle
• The binding number of a graph and its circuits
• Binding number, minimum degree and bipancyclism in bipartite graphs
• An optimal binding number condition for bipancyclism

Cited in

(4)

• The binding number of a graph and its pancyclism
• The binding number of a graph and its circuits
• The binding number of a graph and its triangle
• The binding number of a graph and its cliques

This page was built for publication: Binding number, cycles, and cliques

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