中文
Home
Scientific research
Research project
Achievements of works
Patent
Paper achievements
Research field
Teaching research
Teaching achievement
Teaching information
Teaching resources
Winning information
Enrollment information
Student information
My album
Teacher blog
Paper achievements
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
Date:2016-01-01
Hits:
Date of Publication:
2016-01-01
Pre One:
Class I graphs of nonnegative characteristic without special cycles
Next One:
A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree
+
Doctorate
黄丹君
MOBILE Version