Xinheng Lin

dblp:366/7501 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 since 2021
YearPublicationVenuePosition
2025 The chromatic number of odd-hole-free graphs
Kaiyang Lan, Xinheng Lin
Discret. Appl. Math.3
2024 Borodin-Kostochka conjecture holds for K1,3¯-free graphs
abstract
The Borodin–Kostochka conjecture says that for a graph G , if Δ ( G ) ≥ 9 , then χ ( G ) ≤ max { Δ ( G ) − 1 , ω ( G ) } . Cranston and Rabern in [SIAM J. Discrete. Math. 27 (2013) 534–549] proved the conjecture holding for K 1 , 3 -free graphs. In this paper, we prove that the conjecture holds for K 1 , 3 ¯ -free graphs, where K 1 , 3 ¯ denotes the complement of K 1 , 3 .
Kaiyang Lan, Xinheng Lin
Discret. Appl. Math.2