The binding number of a graph and its triangle
From MaRDI portal
DOI10.1007/BF01666521zbMATH Open0638.05047OpenAlexW2080219612MaRDI QIDQ1099191FDOQ1099191
Authors: Ronghua Shi
Publication date: 1985
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01666521
Recommendations
Cites Work
Cited In (9)
- Triangles and neighbourhoods of independent sets in graphs
- Binding number, minimum degree, and cycle structure in graphs
- Binding number, cycles, and cliques
- The binding number of a graph and its circuits
- Binding number, odd \([1, b]\)-factors and the distance spectral radius
- The binding number of a digraph and its computation
- The binding number of a graph and its pancyclism
- The binding number of a graph and its cliques
- The Binding Number of a Digraph
This page was built for publication: The binding number of a graph and its triangle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1099191)