兰开阳｜闽南师范大学｜学者主页

期刊论文

2026

Trisimplicial vertices in (fork, odd parachute)-free graphs

Kaiyang Lan, Feng Liu, Di Wu, Yidong Zhou

Discrete Mathematics

DOI

2026

On two conjectures of Hoàng

Hongzhang Chen, Kaiyang Lan, Wenlong Zhong

Discrete Applied Mathematics

DOI

2025

The chromatic number of odd-hole-free graphs

Rong Chen, Kaiyang Lan, Xin-Heng Lin, Yidong Zhou

Discrete Applied Mathematics

DOI

2025

2P3-free graphs that do not contain any induced subdivision of K4 are 4-colorable

Na Chen, Kaiyang Lan

Discrete Mathematics

DOI

2024

Borodin-Kostochka conjecture holds for K1,3¯-free graphs

Kaiyang Lan, Xin-Heng Lin

Discrete Applied Mathematics

DOI

2024

Coloring hammer-free graphs with Δ - 1 colors

Rong Chen, Kaiyang Lan, Xin-Heng Lin

Discrete Mathematics

DOI

2024

Coloring <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e135" altimg="si5.svg"><mml:mrow><mml:mo>{</mml:mo><mml:mi>P</mml:mi><mml:mn>2</mml:mn><mml:mo linebreak="goodbreak" linebreakstyle="after">∪</mml:mo><mml:mi>P</mml:mi><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mi

Rong Chen, Kaiyang Lan, Yidong Zhou

Discrete Applied Mathematics

DOI

2024

A NOTE ON -BINDING FUNCTIONS AND LINEAR FORESTS

Kaiyang Lan, Feng Liu, Di Wu, Yidong Zhou

Bulletin of the Australian Mathematical Society

DOI

2024

Borodin–Kostochka’s Conjecture on $$\{P_2\cup P_3,C_4\}$$-Free Graphs

Kaiyang Lan, Feng Liu, Yidong Zhou

Graphs and Combinatorics

DOI

2021

模的n-phantom态射与n-Ext-phantom态射

兰开阳

《西北民族大学》

2021

关于n-phantom-态射和n-Ext-phantom-态射的刻画

兰开阳，卢博

《浙江大学学报(理学版)》

2020

关于模的一类特殊态射的刻画

兰开阳，杨婷婷

《山东大学学报(理学版)》

2020

相对于半对偶模的f-内射模

兰开阳，卢博

《山东大学学报(理学版)》

The chromatic number of {P2∪P3,banner}-free graphs

Jiali Long, Kaiyang Lan, Yan Wang

Applied Mathematics and Computation

DOI

预印本

2026

An improved polynomial $χ$-bound for $\{P_5,C_5\}$-free graphs

Kaiyang Lan, Wenlong Zhong

arXiv (Cornell University)

DOI

2026

The optimal $χ$-bound for $\{P_6, \text{dart}, K_4\}$-free graphs

Zhou, Yidong, Kaiyang Lan

arXiv (Cornell University)

DOI

2026

On a problem of Sivaraman and a problem of Gyárfás

Kaiyang Lan, Wenlong Zhong

arXiv (Cornell University)

DOI

2022

Every signed planar graph without cycles of length from 4 to 7 is 3-colorable

Lan Kaiyang, Liu Feng

arXiv preprint

兰开阳

精选作品

期刊论文

Trisimplicial vertices in (fork, odd parachute)-free graphs

On two conjectures of Hoàng

The chromatic number of odd-hole-free graphs

2P3-free graphs that do not contain any induced subdivision of K4 are 4-colorable

Borodin-Kostochka conjecture holds for K1,3¯-free graphs

Coloring hammer-free graphs with Δ - 1 colors

A NOTE ON -BINDING FUNCTIONS AND LINEAR FORESTS

Borodin–Kostochka’s Conjecture on $$\{P_2\cup P_3,C_4\}$$-Free Graphs

模的n-phantom态射与n-Ext-phantom态射

关于n-phantom-态射和n-Ext-phantom-态射的刻画

关于模的一类特殊态射的刻画

相对于半对偶模的f-内射模

The chromatic number of {P2∪P3,banner}-free graphs

预印本

An improved polynomial $χ$-bound for $\{P_5,C_5\}$-free graphs

The optimal $χ$-bound for $\{P_6, \text{dart}, K_4\}$-free graphs

On a problem of Sivaraman and a problem of Gyárfás

Every signed planar graph without cycles of length from 4 to 7 is 3-colorable

研究方向

精选作品

期刊论文

Trisimplicial vertices in (fork, odd parachute)-free graphs

On two conjectures of Hoàng

The chromatic number of odd-hole-free graphs

2P3-free graphs that do not contain any induced subdivision of K4 are 4-colorable

Borodin-Kostochka conjecture holds for K1,3¯-free graphs

Coloring hammer-free graphs with Δ - 1 colors

A NOTE ON -BINDING FUNCTIONS AND LINEAR FORESTS

Borodin–Kostochka’s Conjecture on $$\{P_2\cup P_3,C_4\}$$-Free Graphs

模的n-phantom态射与n-Ext-phantom态射

关于n-phantom-态射和n-Ext-phantom-态射的刻画

关于模的一类特殊态射的刻画

相对于半对偶模的f-内射模

The chromatic number of {P2∪P3,banner}-free graphs

预印本

An improved polynomial $χ$-bound for $\{P_5,C_5\}$-free graphs

The optimal $χ$-bound for $\{P_6, \text{dart}, K_4\}$-free graphs

On a problem of Sivaraman and a problem of Gyárfás

Every signed planar graph without cycles of length from 4 to 7 is 3-colorable

研究方向

Coloring hammer-free graphs with Δ - 1 colors