:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Beaudoire, Grégoire, Bentz, Cédric, Picouleau, Christophe
Format:	Preprint
Published:	2026
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2603.02956
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Antimagic labellings of (k, 2)-bipartite biregular graphs
by: Beaudoire, Grégoire, et al.
Published: (2024)

Antimagicness of graphs with a dominating clique
by: Beaudoire, Grégoire, et al.
Published: (2025)

Antimagic labelings of a complete graph
by: Bhavale, Dr A. N.
Published: (2025)

On the zero-free region for the chromatic polynomial of graphs with maximum degree $Δ$ and girth $g$
by: Fialho, Paula M. S., et al.
Published: (2024)

Antimagic and product antimagic graphs with pendant edges
by: Mora, Mercè, et al.
Published: (2024)

Injective edge-coloring of claw-free graphs with maximum degree 4
by: Huang, Danjun, et al.
Published: (2025)

Caterpillars are Antimagic
by: Lozano, Antoni, et al.
Published: (2018)

Nonregular graphs with a given maximum degree attaining maximum spectral radius
by: Huang, Zejun, et al.
Published: (2024)

On the Borodin--Kostochka conjecture for graphs with large maximum degree
by: Liu, Feng, et al.
Published: (2026)

Injective edge-coloring of graphs with small maximum degree
by: Huang, Danjun, et al.
Published: (2025)

Antimagic Labelings of Caterpillars
by: Lozano, Antoni, et al.
Published: (2017)

Total coloring graphs with large maximum degree
by: Dalal, Aseem, et al.
Published: (2024)

On the maximum degree of induced subgraphs of the Kneser graph
by: Chau, Hou Tin, et al.
Published: (2023)

On graphs with chromatic number and maximum degree both equal to nine
by: Galindo, Rachel, et al.
Published: (2024)

Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
by: Chakraborty, Dipayan, et al.
Published: (2024)

The maximum degree of the $r$th power of a sparse random graph
by: Frieze, Alan, et al.
Published: (2024)

Antimagicness of Tensor product for some wheel related graphs with star
by: Latchoumanane, Vinothkumar, et al.
Published: (2023)

Local Distance Antimagic Vertex Coloring of Graphs
by: T, Divya, et al.
Published: (2021)

Between proper and square colorings of planar graphs with maximum degree at most four
by: Liu, Xujun, 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)

The maximum size of a nonhamiltonian-connected graph with given order and minimum degree
by: Zhang, Leilei
Published: (2024)

Extremal chemical graphs of maximum degree at most 3 for 33 degree-based topological indices
by: Bonte, Sébastien, et al.
Published: (2025)

On $k$-Shifted Antimagic Spider Forests
by: Chang, Fei-Huang, et al.
Published: (2021)

Complete polyhedral description of chemical graphs of maximum degree at most 3
by: Dusollier, Valentin, et al.
Published: (2025)

On induced subgraphs of $H(n,3)$ with maximum degree $1$
by: Potechin, Aaron, et al.
Published: (2024)

A sufficient condition for planar graphs with maximum degree eight to be totally 9-colorable
by: Deniz, Zakir, et al.
Published: (2025)

The row left rank of a quaternion unit gain graph in terms of maximum degree
by: Lu, Yong, et al.
Published: (2025)

Bipartite graphs are $(\frac{4}{5}-\varepsilon) \fracΔ{\log Δ}$-choosable
by: Bradshaw, Peter, et al.
Published: (2024)

Antimagic Labeling of Graphs Using Prime Numbers
by: Islam, Arafat, et al.
Published: (2024)

On the $Δ$-edge stability number of graphs
by: Akbari, Saieed, et al.
Published: (2024)

On the maximum $σ$-irregularity of trees with given order and maximum degree
by: Bašić, Milan
Published: (2026)

2-distance 20-coloring of planar graphs with maximum degree 6
by: Aoki, Kengo
Published: (2024)

Relaxation of Wegner's Planar Graph Conjecture for maximum degree 4
by: Cho, Eun-Kyung, et al.
Published: (2022)

Hypergraph independence bounds: from maximum degree to average degree
by: Yu, Jing, et al.
Published: (2026)

The Ramsey numbers for trees of order $n$ with maximum degree at least $n-5$ versus the wheel graph of order nine
by: Chng, Zhi Yee, et al.
Published: (2024)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
by: Botler, Fábio, et al.
Published: (2025)

Majority additive coloring and the maximum degree
by: Brause, Christoph, et al.
Published: (2025)

Distance Antimagic Labeling of Zero-Divisor Graphs
by: Sivakumaran, V., et al.
Published: (2024)

Identifying codes in triangle-free graphs of bounded maximum degree
by: Chakraborty, Dipayan, et al.
Published: (2024)

Brooks' theorem for signed graphs with $Δ=3$
by: Naserasr, Reza, et al.
Published: (2025)