Miaomiao Han

Orcid: 0000-0002-4634-0102

According to our database1, Miaomiao Han authored at least 22 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Square coloring of planar graphs with maximum degree at most five.
Discret. Appl. Math., 2024

2023
Promoting musical instrument learning in virtual reality environment: Effects of embodiment and visual cues.
Comput. Educ., June, 2023

Strong Edge Coloring of K4(t)-Minor Free Graphs.
Axioms, June, 2023

2022
Modulo orientations and matchings in graphs.
Discret. Math., 2022

Weighted Modulo Orientations of Graphs and Signed Graphs.
Electron. J. Comb., 2022

A Study on the Influence of Cue Marking in Digital Textbooks on the Reading Effect of College Students.
Proceedings of the 2022 5th International Conference on Education Technology Management, 2022

In-depth analysis of college students' online discussion interaction based on behavior sequence.
Proceedings of the ICDEL 2022: The 7th International Conference on Distance Education and Learning, Beijing, China, May 20, 2022

2021
Integer Flows and Modulo Orientations of Signed Graphs.
SIAM J. Discret. Math., 2021

Group connectivity under 3-edge-connectivity.
J. Graph Theory, 2021

Design and Implementation of Virtual Sanxian Teaching System.
Proceedings of the 2021 IEEE International Conference on Engineering, 2021

2020
Contractible graphs for flow index less than three.
Discret. Math., 2020

Eulerian Subgraphs and <i>S</i>-connectivity of Graphs.
Appl. Math. Comput., 2020

2019
List star edge coloring of k-degenerate graphs.
Discret. Math., 2019

Modulo 5-orientations and degree sequences.
Discret. Appl. Math., 2019

2018
Mod (2p+1)-Orientation on Bipartite Graphs and Complementary Graphs.
SIAM J. Discret. Math., 2018

Nowhere-zero 3-flow and -connectedness in graphs with four edge-disjoint spanning trees.
J. Graph Theory, 2018

Counterexamples to Jaeger's Circular Flow Conjecture.
J. Comb. Theory B, 2018

Neighbor sum distinguishing total coloring of graphs with bounded treewidth.
J. Comb. Optim., 2018

Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring.
Discret. Appl. Math., 2018

Modulo orientations with bounded independence number.
Discret. Appl. Math., 2018

2016
On dense strongly Z<sub>2s-1</sub>-connected graphs.
Discret. Math., 2016

2015
Graphs with a 3-Cycle-2-Cover.
Graphs Comb., 2015


  Loading...