:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Liu, Feng, Sun, Shuang, Wang, Yan, Zeng, Jiasheng
Format:	Preprint
Published:	2026
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2603.16670
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On Borodin-Kostochka conjecture for correspondence coloring
by: Dvořák, Zdeněk, et al.
Published: (2026)

Borodin-Kostochka conjecture for a family of $P_6$-free graphs
by: Wu, Di, et al.
Published: (2023)

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

Spanning trees with large maximum degrees
by: Yan, Jun
Published: (2025)

Nonregular graphs with a given maximum degree attaining maximum spectral radius
by: Huang, Zejun, 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)

Generalized Turán results for disjoint copies of degenerate graphs
by: Yang, Caihong, et al.
Published: (2025)

On the structures of {diamond, bowtie}-free graphs that do not contain an induced subdivision of $K_4$
by: Liu, Feng, et al.
Published: (2026)

On the $(k+2,k)$-problem of Brown, Erdős and Sós for even integers $k$
by: Wang, Yan, et al.
Published: (2026)

Equating three degrees of graphs
by: Liu, Zhen, et al.
Published: (2025)

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

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

Between proper and square colorings of planar graphs with maximum degree at most four
by: Liu, Xujun, et al.
Published: (2026)

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

Antimagic labelling of graphs with maximum degree $Δ(G) = n - 4$
by: Beaudoire, Grégoire, et al.
Published: (2026)

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

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

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)

Compatible Hamilton cycles in graphs with large minimum degree
by: Behague, Natalie, et al.
Published: (2026)

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

Subdivision-free graphs with the maximum spectral radius
by: Sun, Wanting, et al.
Published: (2025)

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

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

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

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

On the maximum spectral radius of planar graphs
by: Yu, Guanglong, et al.
Published: (2025)

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

A polynomial time algorithm to find star chromatic index on bounded treewidth graphs with given maximum degree
by: Wang, Yichen, et al.
Published: (2024)

Ordered Yao graphs: maximum degree, edge numbers, and clique numbers
by: Ágoston, Péter, et al.
Published: (2025)

On the existence of minimally tough graphs having large minimum degrees
by: Hasanvand, Morteza
Published: (2025)

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

Total coloring graphs with large minimum degree
by: Henderschedt, Owen, et al.
Published: (2025)

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

Feedback vertex sets of digraphs with bounded maximum degree
by: Ai, Jiangdong, et al.
Published: (2025)

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

Anticoncentration of random spanning trees in graphs with large minimum degree
by: Bitonti, Veronica, et al.
Published: (2026)

Flexible list coloring of graphs with maximum average degree less than $3$
by: Bi, Richard, et al.
Published: (2023)

On 2-distance 16-coloring of planar graphs with maximum degree at most five
by: Deniz, Zakir
Published: (2023)