Saved in:
| Main Author: | Deng, Kecai |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2507.17302 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Regular graphs are universally 3-edge-weightable
by: Deng, Kecai
Published: (2026)
by: Deng, Kecai
Published: (2026)
Every graph is uniform-span $(2,2)$-choosable: Beyond the 1-2 conjecture
by: Deng, Kecai, et al.
Published: (2025)
by: Deng, Kecai, et al.
Published: (2025)
Bipartite Graphs With Minimum Degree at Least 15 Are Antimagic
by: Kecai Deng
Published: (2026)
by: Kecai Deng
Published: (2026)
Hamilton cycles in random digraphs with minimum degree at least one
by: Cooper, Colin, et al.
Published: (2023)
by: Cooper, Colin, et al.
Published: (2023)
Proper 3-orientations of bipartite planar graphs with minimum degree at least 3
by: Noguchi, Kenta
Published: (2019)
by: Noguchi, Kenta
Published: (2019)
Every connected graph admits a local antimagic orientation and almost every graph admits an antimagic orientation
by: Dhananjaya, Eranda, et al.
Published: (2024)
by: Dhananjaya, Eranda, et al.
Published: (2024)
The minimum size of a chordal graph with given order and minimum degree
by: Zhan, Xingzhi, et al.
Published: (2024)
by: Zhan, Xingzhi, et al.
Published: (2024)
Antimagic and product antimagic graphs with pendant edges
by: Mora, Mercè, et al.
Published: (2024)
by: Mora, Mercè, et al.
Published: (2024)
Cycle lengths in graphs of given minimum degree
by: Bai, Yandong, et al.
Published: (2025)
by: Bai, Yandong, et al.
Published: (2025)
Building graphs with high minimum degree on a budget
by: Katsamaktsis, Kyriakos, et al.
Published: (2024)
by: Katsamaktsis, Kyriakos, et al.
Published: (2024)
Compatible Hamilton cycles in graphs with large minimum degree
by: Behague, Natalie, et al.
Published: (2026)
by: Behague, Natalie, et al.
Published: (2026)
Paired domination in graphs with minimum degree four
by: Bujtás, Csilla, et al.
Published: (2025)
by: Bujtás, Csilla, et al.
Published: (2025)
Total coloring graphs with large minimum degree
by: Henderschedt, Owen, et al.
Published: (2025)
by: Henderschedt, Owen, et al.
Published: (2025)
On the isolation number of graphs with minimum degree four
by: Goddard, Wayne, et al.
Published: (2025)
by: Goddard, Wayne, et al.
Published: (2025)
The circumference of a graph with given minimum degree and clique number
by: Chen, Na, et al.
Published: (2025)
by: Chen, Na, et al.
Published: (2025)
Improved bounds for the minimum degree of minimal multicolor Ramsey graphs
by: Attwa, Yamaan, et al.
Published: (2025)
by: Attwa, Yamaan, et al.
Published: (2025)
On the existence of minimally tough graphs having large minimum degrees
by: Hasanvand, Morteza
Published: (2025)
by: Hasanvand, Morteza
Published: (2025)
Trees whose even-degree vertices induce a path are antimagic
by: Lozano, Antoni, et al.
Published: (2019)
by: Lozano, Antoni, et al.
Published: (2019)
Anticoncentration of random spanning trees in graphs with large minimum degree
by: Bitonti, Veronica, et al.
Published: (2026)
by: Bitonti, Veronica, et al.
Published: (2026)
Odd and even cycle lengths, minimum degree and chromatic number in graphs
by: Wang, Xiaolin
Published: (2025)
by: Wang, Xiaolin
Published: (2025)
Arbitrary orientations of Hamilton cycles in directed graphs of large minimum degree
by: DeBiasio, Louis, et al.
Published: (2025)
by: DeBiasio, Louis, et al.
Published: (2025)
A strengthening on consecutive odd cycles in graphs of given minimum degree
by: Lin, Hao, et al.
Published: (2024)
by: Lin, Hao, et al.
Published: (2024)
Complete tripartite subgraphs of balanced tripartite graphs with large minimum degree
by: Chen, Yihan, et al.
Published: (2024)
by: Chen, Yihan, et al.
Published: (2024)
$E_A$-cordial labeling of graphs and its implications for $A$-antimagic labeling of trees
by: Cichacz, Sylwia
Published: (2024)
by: Cichacz, Sylwia
Published: (2024)
On the least size of a graph with a given degree set -- II
by: Moondra, Jai, et al.
Published: (2020)
by: Moondra, Jai, et al.
Published: (2020)
Monochromatic cycle partitions of $r$-edge-coloured graphs with high minimum degree
by: Di Braccio, Francesco, et al.
Published: (2026)
by: Di Braccio, Francesco, et al.
Published: (2026)
The maximum number of cliques in graphs with given fractional matching number and minimum degree
by: Li, Chengli, et al.
Published: (2024)
by: Li, Chengli, et al.
Published: (2024)
Tight minimum degree conditions for apex-outerplanar minors and subdivisions in graphs and digraphs
by: Liu, Chun-Hung, et al.
Published: (2024)
by: Liu, Chun-Hung, et al.
Published: (2024)
The maximum size of a nonhamiltonian-connected graph with given order and minimum degree
by: Zhang, Leilei
Published: (2024)
by: Zhang, Leilei
Published: (2024)
A closure result on spanning $k$-trees of graphs with given minimum degree
by: Zhang, Wenqian
Published: (2026)
by: Zhang, Wenqian
Published: (2026)
Monochromatic cycles in 2-edge-colored bipartite graphs with large minimum degree
by: Zhang, Yiran, et al.
Published: (2023)
by: Zhang, Yiran, et al.
Published: (2023)
The minimum number of detours in a connected graph of minimum degree three
by: Liu, Xining, et al.
Published: (2026)
by: Liu, Xining, et al.
Published: (2026)
Sufficient conditions for the variation of toughness under the distance spectral in graphs involving minimum degree
by: Li, Peishan
Published: (2025)
by: Li, Peishan
Published: (2025)
Edge density and minimum degree thresholds for $H$-free graphs with unbounded chromatic number
by: Wu, Zhuo, et al.
Published: (2025)
by: Wu, Zhuo, et al.
Published: (2025)
On the minimum degree of minimal $k$-$\{1,2\}$-factor critical $k$-planar graphs
by: Pereyra, Kevin
Published: (2026)
by: Pereyra, Kevin
Published: (2026)
Size and spectral conditions for a graph with given minimum degree to be $k$-$d$-critical
by: Zhang, Zhenhao, et al.
Published: (2026)
by: Zhang, Zhenhao, et al.
Published: (2026)
The local antimagic (total) chromatic numbers of firecracker graphs and edge-corona product graphs
by: Yang, Xue, et al.
Published: (2026)
by: Yang, Xue, et al.
Published: (2026)
On local antimagic chromatic numbers of the join of two special families of graphs
by: Lau, Gee-Choon, et al.
Published: (2024)
by: Lau, Gee-Choon, et al.
Published: (2024)
Complete characterization of graphs with local total antimagic chromatic number 3
by: Lau, G. C.
Published: (2024)
by: Lau, G. C.
Published: (2024)
New Families of tripartite graphs with local antimagic chromatic number 3
by: Lau, Gee-Choon, et al.
Published: (2024)
by: Lau, Gee-Choon, et al.
Published: (2024)
Similar Items
-
Regular graphs are universally 3-edge-weightable
by: Deng, Kecai
Published: (2026) -
Every graph is uniform-span $(2,2)$-choosable: Beyond the 1-2 conjecture
by: Deng, Kecai, et al.
Published: (2025) -
Bipartite Graphs With Minimum Degree at Least 15 Are Antimagic
by: Kecai Deng
Published: (2026) -
Hamilton cycles in random digraphs with minimum degree at least one
by: Cooper, Colin, et al.
Published: (2023) -
Proper 3-orientations of bipartite planar graphs with minimum degree at least 3
by: Noguchi, Kenta
Published: (2019)