A neighborhood union condition for fractional (a, b, k)-critical covered graphs
From MaRDI portal
Publication:2091817
Recommendations
- Discussion on fractional (a, b, k)-critical covered graphs
- Degree conditions for fractional \((a,b,k)\)-critical covered graphs
- A result on fractional \((a,b,k)\)-critical covered graphs
- Notes on fractional (a, b, k)-critical covered graphs
- Independence number and connectivity for fractional \((a, b, k)\)-critical covered graphs
Cites work
- 2-factors with the bounded number of components in line graphs
- A degree condition for fractional \([a,b]\)-covered graphs
- A generalization of orthogonal factorizations in digraphs
- A neighbourhood condition for graphs to have \([a,b]\)-factors
- A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
- A sufficient condition for the existence of restricted fractional (g, f)-factors in graphs
- An isolated toughness condition for graphs to be fractional (k, m)-deleted graphs
- Binding numbers and restricted fractional ( g , f )-factors in graphs
- Characterization of forbidden subgraphs for the existence of even factors in a graph
- Characterizations of maximum fractional (g,f)-factors of graphs
- Closure operation for even factors on claw-free graphs
- Degree conditions for fractional \((a,b,k)\)-critical covered graphs
- Degree conditions for graphs to be fractional k-covered graphs.
- Graph theory
- Isolated toughness and path-factor uniform graphs
- Neighborhood union conditions for fractional \([a, b]\)-covered graphs
- Neighborhood-union condition for an \([a, b]\)-factor avoiding a specified Hamiltonian cycle
- New isolated toughness condition for fractional (g,f,n)-critical graphs
- On k-orthogonal factorizations in networks
- Path factors in subgraphs
- Remarks on path factors in graphs
- Research on fractional critical covered graphs
- Some results about component factors in graphs
- Some results on path-factor critical avoidable graphs
- Subgraphs with orthogonal factorizations in graphs
- Tight toughness condition for fractional (g,f,n)-critical graphs
Cited in
(49)- Two Sufficient Conditions for Graphs to Admit Path Factors
- An improvement of the previous result on fractional (a,b,k)-critical covered graphs
- Degree conditions for the existence of a {P2, P5}-factor in a graph
- A degree condition for fractional (g, f, n)-critical covered graphs
- Path-factor critical covered graphs and path-factor uniform graphs
- \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs
- The A_-spectral radius for path-factors in graphs
- Toughness, fractional extendability and distance spectral radius in graphs
- A result on fractional \((a,b,k)\)-critical covered graphs
- Neighborhood union conditions for fractional \([a, b]\)-covered graphs
- Nash-Williams conditions for the existence of all fractional \([a,b]\)-factors
- Degree conditions for fractional \((a,b,k)\)-critical covered graphs
- Distance signless Laplacian spectral radius for the existence of path-factors in graphs
- Spectral conditions for component factors in graphs involving minimum degree
- Sufficient conditions for graphs to have strong parity factors
- Some sufficient conditions for path-factor uniform graphs
- On \(P_{\geq 3}\)-factor deleted graphs
- Feasibility of data transmission under attack: from isolated toughness variant perspective
- Degree conditions for graphs to be fractional k-covered graphs.
- An existence theorem on fractional ID-\((g, f)\)-factor-critical covered graphs
- Discussion on fractional (a, b, k)-critical covered graphs
- Discussions on orthogonal factorizations in digraphs
- Some spectral conditions for star-factors in bipartite graphs
- A sufficient condition for fractional (2, b, k)-critical covered graphs
- Sufficient conditions for a graph \(kG\) admitting all \([1, k]\)-factors
- Component factors and binding number conditions in graphs
- Binding numbers for fractional \((a, b, k)\)-critical covered graphs
- Toughness for fractional \((2, b, k)\)-critical covered graphs
- Laplacian eigenvalue condition for a graph to have the strong parity property
- Spanning k-trees and distance signless Laplacian spectral radius of graphs
- A Note of Generalization of Fractional ID-factor-critical Graphs
- Some results about ID-path-factor critical graphs
- Sun toughness and path-factor uniform graphs
- On all fractional \({(a,b,k)}\)-critical graphs
- Path factors and neighborhoods of independent sets in graphs
- Independence number and minimum degree for path-factor critical uniform graphs
- Two sufficient conditions for odd \([1,b]\)-factors in graphs
- A neighborhood union condition for fractional (k,n',m)-critical deleted graphs
- Some results about star-factors in graphs
- Tight isolated toughness bound for fractional (a,b,m)-deleted graphs
- Characterizing spanning trees via the size or the spectral radius of graphs
- Star-factors with large components, fractional k-extendability and spectral radius in graphs
- A spectral condition for component factors in graphs
- Independence number and connectivity for fractional \((a, b, k)\)-critical covered graphs
- Tight Toughness Bounds for Fractional ( k, n )-Critical Graphs with Large n
- An odd \([1, b]\)-factor in a graph from signless Laplacian spectral radius
- On path-factor critical uniform graphs
- A spectral condition for the existence of component factors in graphs
- Notes on fractional (a, b, k)-critical covered graphs
This page was built for publication: A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2091817)
