MHMiaomiao Han
Miaomiao Han
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Miaomiao Han has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Jiaao Li
School of Mathematical Sciences and LPMC Nankai University Tianjin China
6 shared publications Hong-Jian Lai
5 shared publications- Hong-Jian Lai
Guangdong Polytechnic Normal University
3 shared publications Yezhou Wu
2 shared publicationsAimei Yu
1 shared publication- Cun-Quan Zhang
Department of Mathematics, West Virginia University, Morgantown, WV 26506 USA
1 shared publication
Latest Publications
- Open Access
Strong Edge Coloring of K4(t)-Minor Free Graphs
A strong edge coloring of a graph G is a proper coloring of edges in G such that any two edges of distance at most 2 are colored with distinct colors. The strong chromatic index is the smallest integer l such that G admits a strong edge coloring using l colors. A -minor free graph is a graph that does not contain as a contraction subgraph, where is obtained from a by subdividing edges exactly times. The paper shows that every -minor free graph with maximum degree has for which generalizes some known results on -minor free graphs by Batenburg, Joannis de Verclos, Kang, Pirot in 2022 and Wang, Wang, and Wang in 2018. These upper bounds are sharp.Open AccessStrong Edge Coloring of K4(t)-Minor Free Graphs
A strong edge coloring of a graph G is a proper coloring of edges in G such that any two edges of distance at most 2 are colored with distinct colors. The strong chromatic index is the smallest integer l such that G admits a strong edge coloring using l colors. A -minor free graph is a graph that does not contain as a contraction subgraph, where is obtained from a by subdividing edges exactly times. The paper shows that every -minor free graph with maximum degree has for which generalizes some known results on -minor free graphs by Batenburg, Joannis de Verclos, Kang, Pirot in 2022 and Wang, Wang, and Wang in 2018. These upper bounds are sharp. - Open Access
- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 8 (6) , 13154-13161
Star edge coloring of $ K_{2, t} $-free planar graphs
The star chromatic index of a graph $ G $, denoted by $ \chi{'}_{st}(G) $, is the smallest number of colors required to properly color $ E(G) $ such that every connected bicolored subgraph is a path with no more than three edges. A graph is $ K_{2, t} $-free if it contains no $ K_{2, t} $ as a subgraph. This paper proves that every $ K_{2, t} $-free planar graph $ G $ satisfies $ \chi_{st}'(G)\le 1.5\Delta +20t+20 $, which is sharp up to the constant term. In particular, our result provides a common generalization of previous results on star edge coloring of outerplanar graphs by Bezegová et al.(2016) and of $ C_4 $-free planar graphs by Wang et al.(2018), as those graphs are subclasses of $ K_{2, 3} $-free planar graphs.- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 8 (6) , 13154-13161
Open AccessStar edge coloring of $ K_{2, t} $-free planar graphs
The star chromatic index of a graph $ G $, denoted by $ \chi{'}_{st}(G) $, is the smallest number of colors required to properly color $ E(G) $ such that every connected bicolored subgraph is a path with no more than three edges. A graph is $ K_{2, t} $-free if it contains no $ K_{2, t} $ as a subgraph. This paper proves that every $ K_{2, t} $-free planar graph $ G $ satisfies $ \chi_{st}'(G)\le 1.5\Delta +20t+20 $, which is sharp up to the constant term. In particular, our result provides a common generalization of previous results on star edge coloring of outerplanar graphs by Bezegová et al.(2016) and of $ C_4 $-free planar graphs by Wang et al.(2018), as those graphs are subclasses of $ K_{2, 3} $-free planar graphs. - 9 March 2022
- Published by Elsevier in Discrete Mathematics
- Vol. 345 (7)
Modulo orientations and matchings in graphs
- 9 March 2022
- Published by Elsevier in Discrete Mathematics
- Vol. 345 (7)
Modulo orientations and matchings in graphs
- 1 November 2020
- Published by Elsevier in Discrete Mathematics
- Vol. 343 (11)
Contractible graphs for flow index less than three
- 1 November 2020
- Published by Elsevier in Discrete Mathematics
- Vol. 343 (11)
Contractible graphs for flow index less than three
- 1 June 2019
- Published by Elsevier in Discrete Mathematics
- Vol. 342 (6) , 1838-1848
List star edge coloring of -degenerate graphs- 1 June 2019
- Published by Elsevier in Discrete Mathematics
- Vol. 342 (6) , 1838-1848
List star edge coloring of -degenerate graphs- 1 May 2019
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 260, 155-163
Modulo 5-orientations and degree sequences
- 1 May 2019
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 260, 155-163
Modulo 5-orientations and degree sequences
- 1 October 2018
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 247, 14-22
Modulo orientations with bounded independence number
- 1 October 2018
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 247, 14-22
Modulo orientations with bounded independence number
- 1 July 2018
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 131, 1-11
Counterexamples to Jaeger's Circular Flow Conjecture
- 1 July 2018
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 131, 1-11
Counterexamples to Jaeger's Circular Flow Conjecture
- 23 March 2018
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 36 (1) , 23-34
Neighbor sum distinguishing total coloring of graphs with bounded treewidth
- 23 March 2018
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 36 (1) , 23-34
Neighbor sum distinguishing total coloring of graphs with bounded treewidth
- 1 March 2018
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 237, 109-115
Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring
- 1 March 2018
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 237, 109-115
Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring