Some sufficient conditions for a graph with minimum degree to be $k$-critical with respect to $[1,b]$-odd factors

Similar Items

• Sufficient conditions for fractional $k$-factor-critical graphs with minimum degree to be $k$-factor-critical
  by: Zhong, Jiaxu, et al.
  Published: (2026)
• Sufficient conditions for a graph with minimum degree to be k-critical with respect to [1,b]-odd factor
  by: Zhou, Sizhong
  Published: (2025)
• On the minimum degree of minimal $k$-$\{1,2\}$-factor critical $k$-planar graphs
  by: Pereyra, Kevin
  Published: (2026)
• Distance spectral radius for a graph to be k-critical with respect to [1,b]-odd factor
  by: Wang, Sufang, et al.
  Published: (2025)
• Size and spectral conditions for a graph with given minimum degree to be $k$-$d$-critical
  by: Zhang, Zhenhao, et al.
  Published: (2026)