The SCEAS System
| |||||||

## Search the dblp DataBase
Weifan Wang:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Yuehua Bu, Weifan Wang
**Some sufficient conditions for a planar graph of maximum degree six to be Class 1.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:13, pp:1440-1445 [Journal] - Mickaël Montassier, André Raspaud, Weifan Wang
**Bordeaux 3-color conjecture and 3-choosability.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:6, pp:573-579 [Journal] - Weifan Wang
**Upper Bounds of Entire Chromatic Number of Plane Graphs.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 1999, v:20, n:4, pp:313-315 [Journal] - Weifan Wang, Yiqiao Wang 0002
**L(p, q)-labelling of K**[Citation Graph (0, 0)][DBLP]_{4}-minor free graphs. Inf. Process. Lett., 2006, v:98, n:5, pp:169-173 [Journal] - Min Chen, Weifan Wang
**The 2-dipath chromatic number of Halin graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2006, v:99, n:2, pp:47-53 [Journal] - Min Chen, André Raspaud, Weifan Wang
**Three-coloring planar graphs without short cycles.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:101, n:3, pp:134-138 [Journal] - Weifan Wang, Ko-Wei Lih
**Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2002, v:15, n:4, pp:538-545 [Journal] - Weifan Wang, Ko-Wei Lih
**Labeling Planar Graphs with Conditions on Girth and Distance Two.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2003, v:17, n:2, pp:264-275 [Journal] - Mickaël Montassier, André Raspaud, Weifan Wang
**Acyclic 5-choosability of planar graphs without small cycles.**[Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2007, v:54, n:3, pp:245-260 [Journal] - Weifan Wang
**Total chromatic number of planar graphs with maximum degree ten.**[Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2007, v:54, n:2, pp:91-102 [Journal] - Weifan Wang
**On the colorings of outerplanar graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1995, v:147, n:1-3, pp:257-269 [Journal] - Xiaofang Luo, Min Chen, Weifan Wang
**On 3-colorable planar graphs without cycles of four lengths.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:103, n:4, pp:150-156 [Journal] - Weifan Wang, Yongzhu Chen
**A sufficient condition for a planar graph to be class 1.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:385, n:1-3, pp:71-77 [Journal] **On 3-colorable planar graphs without short cycles.**[Citation Graph (, )][DBLP]**(2, 1)-Total labelling of outerplanar graphs.**[Citation Graph (, )][DBLP]**Labelling planar graphs without 4-cycles with a condition on distance two.**[Citation Graph (, )][DBLP]**Injective coloring of planar graphs.**[Citation Graph (, )][DBLP]**On 3-colorable planar graphs without prescribed cycles.**[Citation Graph (, )][DBLP]**Acyclic 5-choosability of planar graphs without 4-cycles.**[Citation Graph (, )][DBLP]**Diameters of uniform subset graphs.**[Citation Graph (, )][DBLP]**On the 3-colorability of planar graphs without 4-, 7- and 9-cycles.**[Citation Graph (, )][DBLP]**The edge-face coloring of graphs embedded in a surface of characteristic zero.**[Citation Graph (, )][DBLP]**Edge choosability of planar graphs without 5-cycles with a chord.**[Citation Graph (, )][DBLP]**Linear coloring of planar graphs with large girth.**[Citation Graph (, )][DBLP]**On the vertex-arboricity of planar graphs.**[Citation Graph (, )][DBLP]
Search in 0.008secs, Finished in 0.010secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |