A neighborhood union condition for fractional (a, b, k)-critical covered graphs
From MaRDI portal
Publication:2091817
DOI10.1016/J.DAM.2021.05.022zbMATH Open1502.05209OpenAlexW3168478447MaRDI QIDQ2091817FDOQ2091817
Publication date: 2 November 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.05.022
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
neighborhood unionfractional \((a, b, k)\)-covered graphfractional \((a, b, k)\)-critical covered graphfractional \((a, b, k)\)-factor
Cites Work
- Title not available (Why is that?)
- A neighbourhood condition for graphs to have \([a,b]\)-factors
- Closure operation for even factors on claw-free graphs
- 2-factors with the bounded number of components in line graphs
- Characterization of forbidden subgraphs for the existence of even factors in a graph
- Characterizations of maximum fractional \((g,f)\)-factors of graphs
- Some results about component factors in graphs
- Remarks on path factors in graphs
- Subgraphs with orthogonal factorizations in graphs
- A generalization of orthogonal factorizations in digraphs
- A degree condition for fractional \([a,b]\)-covered graphs
- Neighborhood union conditions for fractional \([a, b]\)-covered graphs
- Degree conditions for fractional \((a,b,k)\)-critical covered graphs
- Neighborhood-union condition for an \([a, b]\)-factor avoiding a specified Hamiltonian cycle
- Degree conditions for graphs to be fractional \(k\)-covered graphs.
- Tight toughness condition for fractional \((g,f,n)\)-critical graphs
- New isolated toughness condition for fractional $(g,f,n)$-critical graphs
- Some results on path-factor critical avoidable graphs
- Research on fractional critical covered graphs
- A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs
- Binding numbers and restricted fractional \(( g , f )\)-factors in graphs
- Title not available (Why is that?)
- A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
- Path factors in subgraphs
- Isolated toughness and path-factor uniform graphs
- On k-orthogonal factorizations in networks
Cited In (33)
- 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_\alpha\)-spectral radius for path-factors in graphs
- A result on fractional \((a,b,k)\)-critical covered graphs
- Distance signless Laplacian spectral radius for the existence of path-factors in graphs
- Nash-Williams conditions for the existence of all fractional \([a,b]\)-factors
- Sufficient conditions for graphs to have strong parity factors
- Some sufficient conditions for path-factor uniform graphs
- Feasibility of data transmission under attack: from isolated toughness variant perspective
- On \(P_{\geq 3}\)-factor deleted graphs
- Discussion on fractional \((a, b, k)\)-critical covered graphs
- Discussions on orthogonal factorizations in digraphs
- 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
- Toughness for fractional \((2, b, k)\)-critical covered graphs
- Spanning \(k\)-trees and distance signless Laplacian spectral radius of graphs
- A Note of Generalization of Fractional ID-factor-critical Graphs
- Sun toughness and path-factor uniform graphs
- Some results about ID-path-factor critical graphs
- Path factors and neighborhoods of independent sets in graphs
- Independence number and minimum degree for path-factor critical uniform graphs
- A neighborhood union condition for fractional $(k,n',m)$-critical deleted graphs
- Two sufficient conditions for odd \([1,b]\)-factors in graphs
- Some results about star-factors in 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
- An existence theorem on fractional ID-(g, f)-factor-critical covered graphs
- An odd \([1, b]\)-factor in a graph from signless Laplacian spectral radius
- On path-factor critical uniform graphs
- Two Sufficient Conditions for Graphs to Admit Path Factors
- Degree conditions for the existence of a {P2, P5}-factor in a graph
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)
