A Note of Generalization of Fractional ID-factor-critical Graphs

Publication date: 31 October 2022

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.08396

zbMATH Keywords

network graph fractional \([a, b\)-factor]binding number fractional ID-\([a, b\)-factor-critical covered graph]

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items (7)

Some results about ID-path-factor critical graphs ⋮ Path factors and neighborhoods of independent sets in graphs ⋮ Two sufficient conditions for odd \([1,b\)-factors in graphs] ⋮ Degree conditions for the existence of a {P₂, P₅}-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

Cites Work

Unnamed Item
A graph theoretic-based heuristic algorithm for responsive supply chain network design with direct and indirect shipment
Graph models and mathematical programming in biochemical network analysis and metabolic engineering design
Two tight independent set conditions for fractional \((g,f,m)\)-deleted graphs systems
Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor
A generalization of orthogonal factorizations in digraphs
Edge-connectivity and edges of even factors of graphs
A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
Discussions on orthogonal factorizations in digraphs
On path-factor critical deleted (or covered) graphs
Path factors in subgraphs
A note on fractional ID-\( [ a , b \)-factor-critical covered graphs]
Research on fractional critical covered graphs
A result on fractional \((a,b,k)\)-critical covered graphs
A toughness condition for fractional \((k, m)\)-deleted graphs revisited
Binding numbers for fractional ID-\(k\)-factor-critical graphs
On designing heteroclinic networks from graphs
Design of Optimal Sparse Interconnection Graphs for Synchronization of Oscillator Networks
On k-orthogonal factorizations in networks
Independence number and connectivity for fractional (a, b, k)-critical covered graphs
Isolated toughness for path factors in networks
The existence of path-factor uniform graphs with large connectivity
The binding number of a graph and its Anderson number
Toughness condition for a graph to be all fractional (g,f,n)-critical deleted
TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS
Isolated toughness and path-factor uniform graphs. II.

This page was built for publication: A Note of Generalization of Fractional ID-factor-critical Graphs