Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Heidi Julien
Claudia Calabrese
Kaige Yan
Hao Mao
Peter Malec
Suki Kim
Giovanni Venturelli
Chen Ma
Radu Timofte
Kuanrui Yin
Home
/
Author
/
RUNRUN LIU
Author Info
Open Visualization
Name
Affiliation
Papers
RUNRUN LIU
Department of Mathematics, Huazhong Normal University, Wuhan, 430079, China
15
Collaborators
Citations
PageRank
19
8
5.29
Referers
Referees
References
10
55
51
Publications (15 rows)
Collaborators (19 rows)
Referers (10 rows)
Referees (55 rows)
Title
Citations
PageRank
Year
Planar Graphs Without 4-Cycles And Intersecting Triangles Are (1,1,0)-Colorable
0
0.34
2021
Connectivity For Kite-Linked Graphs
0
0.34
2021
Planar graphs without short even cycles are near-bipartite
0
0.34
2020
DP-4-colorability of planar graphs without adjacent cycles of given length
0
0.34
2020
Planar graphs without 7-cycles and butterflies are DP-4-colorable
0
0.34
2020
Every planar graph without adjacent cycles of length at most 8 is 3-choosable.
0
0.34
2019
DP-4-colorability of two classes of planar graphs
0
0.34
2019
DP-3-coloring of some planar graphs.
1
0.36
2019
DP-3-Coloring of Planar Graphs Without 4, 9-Cycles and Cycles of Two Lengths from {6, 7, 8}.
0
0.34
2019
Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph
0
0.34
2019
Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable.
1
0.36
2019
Minimum degree condition for a graph to be knitted
0
0.34
2019
Planar graphs without 4-cycles and close triangles are (2, 0, 0)-colorable
0
0.34
2018
Planar graphs without 5-cycles and intersecting triangles are (1,1,0)-colorable
3
0.42
2016
A relaxation of the Bordeaux Conjecture.
3
0.42
2015
1