A Note of Generalization of Fractional ID-factor-critical Graphs
From MaRDI portal
(Redirected from Publication:5044393)
binding numberfractional \([a, b\)-factor]fractional ID-\([a, b\)-factor-critical covered graph]graphnetwork
Recommendations
- Remarks on fractional ID-\(k\)-factor-critical graphs
- A result on fractional ID-k-factor-critical graphs
- A result on fractional ID-\([a,b]\)-factor-critical graphs
- scientific article; zbMATH DE number 6606170
- A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
- scientific article; zbMATH DE number 7559987
- A Fan-type result on fractional ID-k-factor-critical graphs.
- Degree conditions of fractional ID-k-factor-critical graphs
- Some results on fractional n-factor-critical graphs
- A degree condition for graphs to be fractional ID-\([a,b]\)-factor-critical
Cites work
- A generalization of orthogonal factorizations in digraphs
- A graph theoretic-based heuristic algorithm for responsive supply chain network design with direct and indirect shipment
- A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
- A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
- A result on fractional \((a,b,k)\)-critical covered graphs
- A toughness condition for fractional \((k, m)\)-deleted graphs revisited
- Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor
- Binding numbers for fractional ID-\(k\)-factor-critical graphs
- Design of Optimal Sparse Interconnection Graphs for Synchronization of Oscillator Networks
- Discussions on orthogonal factorizations in digraphs
- Edge-connectivity and edges of even factors of graphs
- Graph models and mathematical programming in biochemical network analysis and metabolic engineering design
- scientific article; zbMATH DE number 7260013 (Why is no real title available?)
- Independence number and connectivity for fractional \((a, b, k)\)-critical covered graphs
- Isolated toughness and path-factor uniform graphs. II.
- Isolated toughness for path factors in networks
- On k-orthogonal factorizations in networks
- On designing heteroclinic networks from graphs
- On path-factor critical deleted (or covered) graphs
- Path factors in subgraphs
- Research on fractional critical covered graphs
- The binding number of a graph and its Anderson number
- The existence of path-factor uniform graphs with large connectivity
- Toughness condition for a graph to be all fractional (g,f,n)-critical deleted
- Toughness, isolated toughness and path factors in graphs
- Two tight independent set conditions for fractional (g,f,m)-deleted graphs systems
Cited in
(11)- Remarks on fractional ID-\(k\)-factor-critical graphs
- Two sufficient conditions for odd \([1,b]\)-factors in graphs
- scientific article; zbMATH DE number 7559987 (Why is no real title available?)
- scientific article; zbMATH DE number 6606170 (Why is no real title available?)
- Some results about ID-path-factor critical graphs
- Path factors and neighborhoods of independent sets in graphs
- Degree conditions for the existence of a {P2, P5}-factor in a graph
- Sufficient conditions for graphs to have strong parity factors
- Sun toughness and path-factor uniform graphs
- Path-factor critical covered graphs and path-factor uniform graphs
- A note of generalization of fractional ID-factor-critical graphs
This page was built for publication: A Note of Generalization of Fractional ID-factor-critical Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5044393)
