Toughness condition for a graph to be all fractional (g,f,n)-critical deleted
From MaRDI portal
Publication:5863628
DOI10.2298/FIL1909735GzbMath1499.05516OpenAlexW3008761226MaRDI QIDQ5863628
Wei Gao, Darko Dimitrov, Wei Fan Wang
Publication date: 3 June 2022
Published in: Filomat (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/fil1909735g
Related Items (11)
Integrity of graph operations ⋮ Discussion on fractional \((a, b, k)\)-critical covered graphs ⋮ Discussions on orthogonal factorizations in digraphs ⋮ The existence of subdigraphs with orthogonal factorizations in digraphs ⋮ A Note of Generalization of Fractional ID-factor-critical Graphs ⋮ Forbidden restrictions and the existence of \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor ⋮ Toughness for fractional \((2, b, k)\)-critical covered graphs ⋮ Subgraphs with orthogonal factorizations in graphs ⋮ A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs ⋮ Sun toughness conditions for \(P_2\) and \(P_3\) factor uniform and factor critical avoidable graphs ⋮ TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A graph theoretic-based heuristic algorithm for responsive supply chain network design with direct and indirect shipment
- Degree conditions for fractional \((g,f,n^\prime,m)\)-critical deleted graphs and fractional ID-\((g,n,f,m)\)-deleted graphs
- Graph models and mathematical programming in biochemical network analysis and metabolic engineering design
- Toughness and the existence of k-factors. II
- Toughness of graphs and \([2,b\)-factors]
- Toughness and the existence of \(k\)-factors. IV
- Toughness and the existence of \(k\)-factors. III
- Two tight independent set conditions for fractional \((g,f,m)\)-deleted graphs systems
- Randomly orthogonal factorizations with constraints in bipartite networks
- Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties
- Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs
- A toughness condition for fractional \((k, m)\)-deleted graphs revisited
- Tight independent set neighborhood union condition for fractional critical deleted graphs and ID deleted graphs
- An independent set degree condition for fractional critical deleted graphs
- A toughness condition for fractional \((k,m)\)-deleted graphs
- A result on \(r\)-orthogonal factorizations in digraphs
- On designing heteroclinic networks from graphs
- On all fractional \({(a,b,k)}\)-critical graphs
- Toughness and the existence of fractional \(k\)-factors of graphs
- Tough graphs and Hamiltonian circuits.
- TIGHT TOUGHNESS CONDITION FOR FRACTIONAL (g, f, n)-CRITICAL GRAPHS
- Remarks on orthogonal factorizations of digraphs
- Design of Optimal Sparse Interconnection Graphs for Synchronization of Oscillator Networks
- Toughness and the existence ofk-factors
- Some results about component factors in graphs
This page was built for publication: Toughness condition for a graph to be all fractional (g,f,n)-critical deleted
