Sufficient conditions for a graph with minimum degree to be k-critical with respect to an odd [1,b]-factor

DOI10.1016/J.DISC.2026.115251MaRDI QIDQ7314003zbMATH OpenFDO

Authors Sizhong Zhou

Publication date 13 August 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115251

Mathematics Subject Classification ID

Vertex degrees (05C07) Extremal problems in graph theory (05C35) Connectivity (05C40) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Eigenvalues, singular values, and eigenvectors (15A18)

Cites work

• 2-factors of cubic bipartite graphs
• A conjecture on \(k\)-factor-critical and 3-\(\gamma \)-critical graphs
• An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues
• Characterizing spanning trees via the size or the spectral radius of graphs
• Distance signless Laplacian spectral radius for the existence of path-factors in graphs
• Existence of 2-factors in tough graphs without forbidden subgraphs
• Factor criticality and complete closure of graphs
• Fan-type results for the existence of [\(a\),\(b\)]-factors
• scientific article; zbMATH DE number 193132 (Why is no real title available?)
• scientific article; zbMATH DE number 238423 (Why is no real title available?)
• Odd factors of a graph
• On k-factor-critical graphs
• Perfect matchings avoiding several independent edges in a star-free graph
• Perfect matchings of a graph
• Regarding r-orthogonal factorizations in bipartite graphs
• Some results about star-factors in graphs
• Some results on odd factors of graphs
• Some results on the k-strong parity property in a graph
• Some spectral conditions for star-factors in bipartite graphs
• Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical
• Spectra of graphs
• Spectral conditions for path-factors in isolated tough graphs
• Spectral radius and matchings in graphs
• The A_-spectral radius for path-factors in graphs
• The Factorization of Linear Graphs
• Toughness, fractional extendability and distance spectral radius in graphs
• Toughness, Hamiltonicity and spectral radius in graphs
• Two sufficient conditions for odd \([1,b]\)-factors in graphs

Cited in

(1)

• Spectral radius and parity \([a,b]\)-factors in graphs

This page was built for publication: Sufficient conditions for a graph with minimum degree to be \(k\)-critical with respect to an odd \([1,b]\)-factor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7314003)