:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Lin, Yen-chi Roger, Munemasa, Akihiro, Taniguchi, Tetsuji, Yoshino, Kiyoto
Format:	Preprint
Published:	2025
Subjects:	Combinatorics 05B40, 05B20, 05C50, 05C70
Online Access:	https://arxiv.org/abs/2503.06377
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Local dimer dynamics in higher dimensions
by: Hartarsky, Ivailo, et al.
Published: (2023)

A cube dismantling problem related to bootstrap percolation
by: Barát, János, et al.
Published: (2026)

Optimal decomposition of $K_{18}$ and $K_{19}$ into $K_3$ and $K_4$
by: Kovář, Petr, et al.
Published: (2025)

A SAT-based Filtering Framework for Exact Coverings of K33 by Cliques of Order 3, 4 or 5
by: Kovař, Petr, et al.
Published: (2026)

Decomposition of Cliques into $k$-Star-Forests
by: Nie, Jiaxi, et al.
Published: (2025)

Difference Methods for Double-Change Covering Designs
by: Chafee, Amanda Lynn, et al.
Published: (2022)

Localized Erdős-Pósa Property for Subdivisions
by: Ai, Icey Siyi, et al.
Published: (2025)

Minimum covering by triples, quadruples and quintuples with minimum excess
by: Kovář, Petr, et al.
Published: (2026)

Sufficient conditions for a graph with minimum degree to have a component factor
by: Wu, Jie
Published: (2025)

Distance spectral radius for a graph to be k-critical with respect to [1,b]-odd factor
by: Wang, Sufang, et al.
Published: (2025)

Some results on the k-strong parity property in a graph
by: Wu, Jie
Published: (2025)

A spectral condition for spanning trees with restricted degrees in bipartite graphs
by: Wu, Jiancheng, et al.
Published: (2024)

Spanning k-trees, odd [1,b]-factors and spectral radius in binding graphs
by: Wu, Jiancheng, et al.
Published: (2025)

Spanning k-trees and distance spectral radius in graphs
by: Zhou, Sizhong, et al.
Published: (2023)

Spanning subgraphs and spectral radius in graphs
by: Zhou, Sizhong
Published: (2025)

Spectral radius conditions for edge-disjoint spanning trees in $(k+c)$-edge-connected graphs
by: Gao, Yongbin, et al.
Published: (2026)

The real equiangular tight frames obtained from rank $3$ graphs
by: Bannai, Eiichi, et al.
Published: (2022)

Perfect matchings and $A_α$-spectral radius in 1-binding graphs
by: Zhou, Sizhong, et al.
Published: (2026)

A spectral condition for a graph having a strong parity factor
by: Zhou, Sizhong, et al.
Published: (2024)

A note on the chromatic number of Kneser graphs on chambers of projective planes and incidence-free sets
by: Heering, Philipp, et al.
Published: (2026)

Some sufficient conditions for graphs to have component factors
by: Zhou, Sizhong
Published: (2024)

Spectral radius and perfect k-matchings in t-connected graphs
by: Pan, Quanru, et al.
Published: (2026)

Minimum forcing numbers of perfect matchings of circular and prismatic graphs
by: Shi, Qiaoyun, et al.
Published: (2025)

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 odd covers of cliques and disjoint unions
by: Buchanan, Calum, et al.
Published: (2024)

Distance spectral radius and perfect matchings in graphs with given fractional property
by: Zhou, Sizhong
Published: (2026)

Eigenvalues and spanning trees with constrained degree
by: Liu, Chang, et al.
Published: (2023)

Signless Laplacian spectral conditions for even factors in graphs
by: Li, Lu, et al.
Published: (2025)

Adjacency spectral radius and H-factors in 1-binding graphs
by: Zhou, Sizhong, et al.
Published: (2025)

Spectral radius and k-factor-critical graphs
by: Zhou, Sizhong, et al.
Published: (2023)

Spectral radii and star-factors with large components
by: Sun, Zhiren, et al.
Published: (2026)

Sufficient conditions for even factors in graphs
by: Zhou, Sizhong, et al.
Published: (2025)

Balanced Domination in Convex Polytopes, Trees, and Grid Graphs
by: Nikolic, Bojan, et al.
Published: (2025)

An Aα-spectral radius for the existence of {P3, P4, P5}-factors in graphs
by: Zhang, Yuli, et al.
Published: (2025)

Aα-spectral radius and path-factor covered graphs
by: Zhou, Sizhong, et al.
Published: (2024)

Incidence-free sets and edge domination in incidence graphs
by: Spiro, Sam, et al.
Published: (2022)

Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
by: Delcourt, Michelle, et al.
Published: (2022)

Construction of Linear Codes from the Unit Graph $G(\mathbb{Z}_{n}\oplus \mathbb{Z}_{m})$
by: Shaikh, Wajid M., et al.
Published: (2024)

Sharp $A_α$-Spectral Conditions for Odd $[1,b]$-Factors When $α>1/2$
by: Huang, Silin
Published: (2026)

Combinatorial designs, difference sets and bent functions as perfect colorings of graphs and multigraphs
by: Potapov, V. N., et al.
Published: (2024)