The binding number of a graph and its Anderson number
From MaRDI portal
Publication:5666592
DOI10.1016/0095-8956(73)90038-5zbMath0253.05139OpenAlexW2039190727WikidataQ56226593 ScholiaQ56226593MaRDI QIDQ5666592
Publication date: 1973
Full work available at URL: https://doi.org/10.1016/0095-8956(73)90038-5
Related Items (94)
The neighbour-integrity of total graphs ⋮ The binding numbers of some Cartesian products of graphs ⋮ Binding number, minimum degree and bipancyclism in bipartite graphs ⋮ The binding number of line graphs and total graphs ⋮ A Note of Generalization of Fractional ID-factor-critical Graphs ⋮ Dense graphs with small clique number ⋮ Hamiltonian cycles in n‐extendable graphs ⋮ RESIDUAL CLOSENESS OF WHEELS AND RELATED NETWORKS ⋮ Component factors and binding number conditions in graphs ⋮ The scattering number of strictly chordal graphs: linear time determination ⋮ The binding number of a graph and its circuits ⋮ Degree sums and spanning brooms of a graph ⋮ The binding number of a graph and its triangle ⋮ Binding Number, Minimum Degree, and Cycle Structure in Graphs ⋮ Claw-free graphs---a survey ⋮ Binding number and toughness for matching extension ⋮ Measuring the vulnerability for classes of intersection graphs ⋮ Path factors in subgraphs ⋮ On the Structure of Non-Hamiltonian Graphs I ⋮ Degree Conditions for Spanning Brooms ⋮ Stability theorems for graph vulnerability parameters ⋮ Toughness, binding number and restricted matching extension in a graph ⋮ Forbidden graphs for degree and neighbourhood conditions ⋮ The binding number of Halin graphs ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ On the Toughness of a Graph ⋮ On the local density problem for graphs of given odd-girth ⋮ \(k\)-factors and Hamilton cycles in graphs ⋮ RESIDUAL CLOSENESS AND GENERALIZED CLOSENESS ⋮ On regular 2-connected 2-path Hamiltonian graphs ⋮ Some results about ID-path-factor critical graphs ⋮ Remarks on component factors ⋮ Forbidden restrictions and the existence of \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor ⋮ Binding number and path-factor critical deleted graphs ⋮ Two Sufficient Conditions for Graphs to Admit Path Factors ⋮ A sufficient condition for the existence of a k-factor excluding a given r-factor ⋮ Feasibility of data transmission under attack: from isolated toughness variant perspective ⋮ Residual closeness of graphs with given parameters ⋮ Wiener index and vulnerability parameters of graphs ⋮ Binding number for coprime graph of groups ⋮ Some existence theorems on path factors with given properties in graphs ⋮ Sun toughness and path-factor uniform graphs ⋮ A Hall-type theorem with algorithmic consequences in planar graphs ⋮ Binding number, \(k\)-factor and spectral radius of graphs ⋮ A binding number condition for graphs to be \((a, b, k)\)-critical graphs ⋮ Best monotone degree conditions for binding number ⋮ Binding number and Hamiltonian (g, f)-factors in graphs II ⋮ Edge-Hamiltonian property in regular 2-connected graphs ⋮ Binding numbers and \([a,b\)-factors excluding a given \(k\)-factor] ⋮ Binding numbers for fractional ID-\(k\)-factor-critical graphs ⋮ Binding Number and Wheel Related Graphs ⋮ Circuits through specified edges ⋮ Toughness and binding number ⋮ A sufficient condition for a graph to have \([a,b\)-factors] ⋮ Graph vulnerability parameters, compression, and threshold graphs ⋮ A parameter linked with \(G\)-factors and the binding number ⋮ Best monotone degree conditions for graph properties: a survey ⋮ Sparse halves in dense triangle-free graphs ⋮ Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs ⋮ Long path connectivity of regular graphs ⋮ Binding numbers and restricted fractional \(( g , f )\)-factors in graphs ⋮ Best monotone degree conditions for binding number and cycle structure ⋮ Robustness of Regular Caterpillars ⋮ Balanced graphs with minimum degree constraints ⋮ Binding numbers and \(f\)-factors of graphs ⋮ Maximal circuits of graphs. I ⋮ Some results on binding number and fractional perfect matching ⋮ Binding number and Hamiltonian \((g,f)\)-factors in graphs ⋮ Unnamed Item ⋮ Some recent results in hamiltonian graphs ⋮ Hamilton cycles in regular 3-connected graphs ⋮ The binding number of a graph and its cliques ⋮ A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs ⋮ Toughness in graphs -- a survey ⋮ A sufficient condition for Hamiltonian circuits ⋮ The binding number of a graph and its pancyclism ⋮ Binding numbers of fractional \(k\)-deleted graphs ⋮ On fractional \((f,n)\)-critical graphs ⋮ Circuits containing specified edges ⋮ On the edge-binding number of some plane graphs ⋮ Hamilton cycles in regular 2-connected graphs ⋮ Degree sums, \(k\)-factors and Hamilton cycles in graphs ⋮ Connection between conjunctive capacity and structural properties of graphs ⋮ Computing the binding number of a graph ⋮ An existence theorem on Hamiltonian (g,f)-factors in networks ⋮ Triply Existentially Complete Triangle‐Free Graphs ⋮ Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs ⋮ Some results about component factors in graphs ⋮ Hamiltonian cycles in 1-tough graphs ⋮ Chromatic polynomials and broken cycles ⋮ Triangles and neighbourhoods of independent sets in graphs ⋮ One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture ⋮ On maximum independent set of categorical product and ultimate categorical ratios of graphs ⋮ Longest cycles in regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs and matching theorems
- Perfect matchings of a graph
- 1-Faktoren von Graphen. (1-factors of graphs)
- On Representatives of Subsets
- Sufficient conditions for matchings
- A Remark on a Graph-Covering Conjecture of D. R. Woodall
- Matchings in graphs
- The Factorization of Linear Graphs
- Systems of representatives
This page was built for publication: The binding number of a graph and its Anderson number
