Bipartite graphs with minimum degree at least 15 are antimagic
Fuente:
arXiv
Guardado en:
| Autor principal: | Deng, Kecai |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Regular graphs are universally 3-edge-weightable
por: Deng, Kecai
Publicado: (2026)
por: Deng, Kecai
Publicado: (2026)
Every graph is uniform-span $(2,2)$-choosable: Beyond the 1-2 conjecture
por: Deng, Kecai, et al.
Publicado: (2025)
por: Deng, Kecai, et al.
Publicado: (2025)
Hamilton cycles in random digraphs with minimum degree at least one
por: Cooper, Colin, et al.
Publicado: (2023)
por: Cooper, Colin, et al.
Publicado: (2023)
Bipartite Graphs With Minimum Degree at Least 15 Are Antimagic
por: Kecai Deng
Publicado: (2026)
por: Kecai Deng
Publicado: (2026)
Proper 3-orientations of bipartite planar graphs with minimum degree at least 3
por: Noguchi, Kenta
Publicado: (2019)
por: Noguchi, Kenta
Publicado: (2019)
Every connected graph admits a local antimagic orientation and almost every graph admits an antimagic orientation
por: Dhananjaya, Eranda, et al.
Publicado: (2024)
por: Dhananjaya, Eranda, et al.
Publicado: (2024)
The minimum size of a chordal graph with given order and minimum degree
por: Zhan, Xingzhi, et al.
Publicado: (2024)
por: Zhan, Xingzhi, et al.
Publicado: (2024)
Cycle lengths in graphs of given minimum degree
por: Bai, Yandong, et al.
Publicado: (2025)
por: Bai, Yandong, et al.
Publicado: (2025)
Antimagic and product antimagic graphs with pendant edges
por: Mora, Mercè, et al.
Publicado: (2024)
por: Mora, Mercè, et al.
Publicado: (2024)
Building graphs with high minimum degree on a budget
por: Katsamaktsis, Kyriakos, et al.
Publicado: (2024)
por: Katsamaktsis, Kyriakos, et al.
Publicado: (2024)
Compatible Hamilton cycles in graphs with large minimum degree
por: Behague, Natalie, et al.
Publicado: (2026)
por: Behague, Natalie, et al.
Publicado: (2026)
The circumference of a graph with given minimum degree and clique number
por: Chen, Na, et al.
Publicado: (2025)
por: Chen, Na, et al.
Publicado: (2025)
Improved bounds for the minimum degree of minimal multicolor Ramsey graphs
por: Attwa, Yamaan, et al.
Publicado: (2025)
por: Attwa, Yamaan, et al.
Publicado: (2025)
On the existence of minimally tough graphs having large minimum degrees
por: Hasanvand, Morteza
Publicado: (2025)
por: Hasanvand, Morteza
Publicado: (2025)
Paired domination in graphs with minimum degree four
por: Bujtás, Csilla, et al.
Publicado: (2025)
por: Bujtás, Csilla, et al.
Publicado: (2025)
Total coloring graphs with large minimum degree
por: Henderschedt, Owen, et al.
Publicado: (2025)
por: Henderschedt, Owen, et al.
Publicado: (2025)
On the isolation number of graphs with minimum degree four
por: Goddard, Wayne, et al.
Publicado: (2025)
por: Goddard, Wayne, et al.
Publicado: (2025)
$E_A$-cordial labeling of graphs and its implications for $A$-antimagic labeling of trees
por: Cichacz, Sylwia
Publicado: (2024)
por: Cichacz, Sylwia
Publicado: (2024)
Anticoncentration of random spanning trees in graphs with large minimum degree
por: Bitonti, Veronica, et al.
Publicado: (2026)
por: Bitonti, Veronica, et al.
Publicado: (2026)
Odd and even cycle lengths, minimum degree and chromatic number in graphs
por: Wang, Xiaolin
Publicado: (2025)
por: Wang, Xiaolin
Publicado: (2025)
Arbitrary orientations of Hamilton cycles in directed graphs of large minimum degree
por: DeBiasio, Louis, et al.
Publicado: (2025)
por: DeBiasio, Louis, et al.
Publicado: (2025)
A strengthening on consecutive odd cycles in graphs of given minimum degree
por: Lin, Hao, et al.
Publicado: (2024)
por: Lin, Hao, et al.
Publicado: (2024)
Complete tripartite subgraphs of balanced tripartite graphs with large minimum degree
por: Chen, Yihan, et al.
Publicado: (2024)
por: Chen, Yihan, et al.
Publicado: (2024)
Trees whose even-degree vertices induce a path are antimagic
por: Lozano, Antoni, et al.
Publicado: (2019)
por: Lozano, Antoni, et al.
Publicado: (2019)
Monochromatic cycle partitions of $r$-edge-coloured graphs with high minimum degree
por: Di Braccio, Francesco, et al.
Publicado: (2026)
por: Di Braccio, Francesco, et al.
Publicado: (2026)
The maximum number of cliques in graphs with given fractional matching number and minimum degree
por: Li, Chengli, et al.
Publicado: (2024)
por: Li, Chengli, et al.
Publicado: (2024)
Tight minimum degree conditions for apex-outerplanar minors and subdivisions in graphs and digraphs
por: Liu, Chun-Hung, et al.
Publicado: (2024)
por: Liu, Chun-Hung, et al.
Publicado: (2024)
The maximum size of a nonhamiltonian-connected graph with given order and minimum degree
por: Zhang, Leilei
Publicado: (2024)
por: Zhang, Leilei
Publicado: (2024)
A closure result on spanning $k$-trees of graphs with given minimum degree
por: Zhang, Wenqian
Publicado: (2026)
por: Zhang, Wenqian
Publicado: (2026)
Monochromatic cycles in 2-edge-colored bipartite graphs with large minimum degree
por: Zhang, Yiran, et al.
Publicado: (2023)
por: Zhang, Yiran, et al.
Publicado: (2023)
On the least size of a graph with a given degree set -- II
por: Moondra, Jai, et al.
Publicado: (2020)
por: Moondra, Jai, et al.
Publicado: (2020)
Sufficient conditions for the variation of toughness under the distance spectral in graphs involving minimum degree
por: Li, Peishan
Publicado: (2025)
por: Li, Peishan
Publicado: (2025)
Edge density and minimum degree thresholds for $H$-free graphs with unbounded chromatic number
por: Wu, Zhuo, et al.
Publicado: (2025)
por: Wu, Zhuo, et al.
Publicado: (2025)
On the minimum degree of minimal $k$-$\{1,2\}$-factor critical $k$-planar graphs
por: Pereyra, Kevin
Publicado: (2026)
por: Pereyra, Kevin
Publicado: (2026)
Size and spectral conditions for a graph with given minimum degree to be $k$-$d$-critical
por: Zhang, Zhenhao, et al.
Publicado: (2026)
por: Zhang, Zhenhao, et al.
Publicado: (2026)
Truncated degree AT-orientations of outerplanar graphs
por: Deng, Chenglong, et al.
Publicado: (2024)
por: Deng, Chenglong, et al.
Publicado: (2024)
The direct product of a star and a path is antimagic
por: Latchoumanane, Vinothkumar, et al.
Publicado: (2023)
por: Latchoumanane, Vinothkumar, et al.
Publicado: (2023)
Forbidden subgraphs generating a finite set of graphs with minimum degree three and large girth
por: Egawa, Yoshimi, et al.
Publicado: (2024)
por: Egawa, Yoshimi, et al.
Publicado: (2024)
Sufficient conditions for fractional $k$-factor-critical graphs with minimum degree to be $k$-factor-critical
por: Zhong, Jiaxu, et al.
Publicado: (2026)
por: Zhong, Jiaxu, et al.
Publicado: (2026)
The local antimagic (total) chromatic numbers of firecracker graphs and edge-corona product graphs
por: Yang, Xue, et al.
Publicado: (2026)
por: Yang, Xue, et al.
Publicado: (2026)
Ejemplares similares
-
Regular graphs are universally 3-edge-weightable
por: Deng, Kecai
Publicado: (2026) -
Every graph is uniform-span $(2,2)$-choosable: Beyond the 1-2 conjecture
por: Deng, Kecai, et al.
Publicado: (2025) -
Hamilton cycles in random digraphs with minimum degree at least one
por: Cooper, Colin, et al.
Publicado: (2023) -
Bipartite Graphs With Minimum Degree at Least 15 Are Antimagic
por: Kecai Deng
Publicado: (2026) -
Proper 3-orientations of bipartite planar graphs with minimum degree at least 3
por: Noguchi, Kenta
Publicado: (2019)