Guardado en:
| Autores principales: | Guo, Mingyang, Lu, Hongliang |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2404.09720 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Covering the edges of a graph with perfect matchings
por: Silina, Olha
Publicado: (2023)
por: Silina, Olha
Publicado: (2023)
Trees maximizing the number of almost-perfect matchings
por: Cambie, Stijn, et al.
Publicado: (2022)
por: Cambie, Stijn, et al.
Publicado: (2022)
Spectral radius and perfect k-matchings in t-connected graphs
por: Pan, Quanru, et al.
Publicado: (2026)
por: Pan, Quanru, et al.
Publicado: (2026)
Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
por: Delcourt, Michelle, et al.
Publicado: (2022)
por: Delcourt, Michelle, et al.
Publicado: (2022)
Minimum forcing numbers of perfect matchings of circular and prismatic graphs
por: Shi, Qiaoyun, et al.
Publicado: (2025)
por: Shi, Qiaoyun, et al.
Publicado: (2025)
Almost-perfect colorful matchings in three-edge-colored bipartite graphs
por: Boyadzhiyska, Simona, et al.
Publicado: (2025)
por: Boyadzhiyska, Simona, et al.
Publicado: (2025)
Distance spectral radius and perfect matchings in graphs with given fractional property
por: Zhou, Sizhong
Publicado: (2026)
por: Zhou, Sizhong
Publicado: (2026)
On covering cubic graphs with three perfect matchings
por: Máčajová, Edita, et al.
Publicado: (2025)
por: Máčajová, Edita, et al.
Publicado: (2025)
Two lower bounds for maximum matching
por: Kuyanov, Fedor
Publicado: (2024)
por: Kuyanov, Fedor
Publicado: (2024)
Three results towards the approximation of special maximum matchings in graphs
por: Mkrtchyan, Vahan
Publicado: (2024)
por: Mkrtchyan, Vahan
Publicado: (2024)
Claw-free minimal matching covered graphs
por: Zhang, Yipei, et al.
Publicado: (2024)
por: Zhang, Yipei, et al.
Publicado: (2024)
Perfect matchings and $A_α$-spectral radius in 1-binding graphs
por: Zhou, Sizhong, et al.
Publicado: (2026)
por: Zhou, Sizhong, et al.
Publicado: (2026)
The minimum number of vertices and edges of connected graphs with ind-match$(G) = p$, min-match$(G) = q$ and match$(G) = r$
por: Matsuda, Kazunori, et al.
Publicado: (2025)
por: Matsuda, Kazunori, et al.
Publicado: (2025)
On the fractional matching extendability of Cayley graphs of Abelian groups
por: Kuzman, Boštjan, et al.
Publicado: (2024)
por: Kuzman, Boštjan, et al.
Publicado: (2024)
Dirac's theorem and the switch geometry of perfect matchings
por: Kang, Ross J., et al.
Publicado: (2026)
por: Kang, Ross J., et al.
Publicado: (2026)
A local spectral condition for perfect matchings in 3-graphs
por: Lin, Huiqiu, et al.
Publicado: (2026)
por: Lin, Huiqiu, et al.
Publicado: (2026)
Spanning $H$-subdivisions and perfect $H$-subdivision tilings in dense digraphs
por: Cheng, Yangyang, et al.
Publicado: (2024)
por: Cheng, Yangyang, et al.
Publicado: (2024)
Maximal independent sets in graphs with given matching number
por: Shi, Yongtang, et al.
Publicado: (2024)
por: Shi, Yongtang, et al.
Publicado: (2024)
Saved by the rook: a case of matchings and Hamiltonian cycles
por: Abreu, Marién, et al.
Publicado: (2021)
por: Abreu, Marién, et al.
Publicado: (2021)
Quantum state systems that count perfect matchings
por: Baldridge, Scott, et al.
Publicado: (2024)
por: Baldridge, Scott, et al.
Publicado: (2024)
The minimum degree of minimal 2-extendable claw-free graphs
por: Guo, Jing, et al.
Publicado: (2025)
por: Guo, Jing, et al.
Publicado: (2025)
New results on graph matching from degree preserving growth
por: Erdős, Péter L., et al.
Publicado: (2022)
por: Erdős, Péter L., et al.
Publicado: (2022)
Induced matching vs edge open packing: trees and product graphs
por: Bresar, Bostjan, et al.
Publicado: (2024)
por: Bresar, Bostjan, et al.
Publicado: (2024)
A generalised Ramsey--Turán problem for matchings
por: Keevash, Peter, et al.
Publicado: (2025)
por: Keevash, Peter, et al.
Publicado: (2025)
Lower bounds for the Randić index in terms of matching number
por: Akbari, Saieed, et al.
Publicado: (2024)
por: Akbari, Saieed, et al.
Publicado: (2024)
Hamiltonian paths extending a set of matchings in hypercubes
por: Ali, Abid, et al.
Publicado: (2025)
por: Ali, Abid, et al.
Publicado: (2025)
The complex of discrete Morse matchings of the $n$-simplex: homotopy types and structural results
por: Scoville, Nicholas A.
Publicado: (2026)
por: Scoville, Nicholas A.
Publicado: (2026)
A generalization of perfect codes in the presence of star multiset transpositions
por: Dejter, Italo J.
Publicado: (2024)
por: Dejter, Italo J.
Publicado: (2024)
Cubic vertices of minimal bicritical graphs
por: Guo, Jing, et al.
Publicado: (2023)
por: Guo, Jing, et al.
Publicado: (2023)
Optimal matching under size priority
por: Enriquez, Nathanaël, et al.
Publicado: (2026)
por: Enriquez, Nathanaël, et al.
Publicado: (2026)
Signless Laplacian spectral conditions for even factors in graphs
por: Li, Lu, et al.
Publicado: (2025)
por: Li, Lu, et al.
Publicado: (2025)
Some results on the k-strong parity property in a graph
por: Wu, Jie
Publicado: (2025)
por: Wu, Jie
Publicado: (2025)
Minimum maximal matchings in permutahedra
por: Brenner, Sofia, et al.
Publicado: (2025)
por: Brenner, Sofia, et al.
Publicado: (2025)
A uniform bound on almost colour-balanced perfect matchings in colour-balanced cliques
por: Hollom, Lawrence
Publicado: (2024)
por: Hollom, Lawrence
Publicado: (2024)
The minimum degree of minimal $k$-factor-critical claw-free graphs*
por: Guo, Jing, et al.
Publicado: (2023)
por: Guo, Jing, et al.
Publicado: (2023)
A Conjecture on Rainbow Hamiltonian Cycle Decomposition
por: Javadi, Ramin, et al.
Publicado: (2024)
por: Javadi, Ramin, et al.
Publicado: (2024)
A (simple) proof of the rna conjecture on powers of cycles
por: Feghali, Carl, et al.
Publicado: (2024)
por: Feghali, Carl, et al.
Publicado: (2024)
A Discrete Logarithm Construction for Orthogonal Double Covers of the Complete Graph by Hamiltonian Paths
por: Ollis, M. A.
Publicado: (2025)
por: Ollis, M. A.
Publicado: (2025)
A spectral condition for a graph having a strong parity factor
por: Zhou, Sizhong, et al.
Publicado: (2024)
por: Zhou, Sizhong, et al.
Publicado: (2024)
A sharp upper bound for the harmonious total chromatic number of graphs and multigraphs
por: Abreu, M., et al.
Publicado: (2024)
por: Abreu, M., et al.
Publicado: (2024)
Ejemplares similares
-
Covering the edges of a graph with perfect matchings
por: Silina, Olha
Publicado: (2023) -
Trees maximizing the number of almost-perfect matchings
por: Cambie, Stijn, et al.
Publicado: (2022) -
Spectral radius and perfect k-matchings in t-connected graphs
por: Pan, Quanru, et al.
Publicado: (2026) -
Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
por: Delcourt, Michelle, et al.
Publicado: (2022) -
Minimum forcing numbers of perfect matchings of circular and prismatic graphs
por: Shi, Qiaoyun, et al.
Publicado: (2025)