|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2 occurrences of 2 keywords
|
|
|
|
|
Results
Found 27 publication records. Showing 27 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Xin Zhang, Guizhen Liu, Jian-Liang Wu |
1-s2.0-S0012365X11004973-si1-forested choosability of planar graphs and sparse graphs.  |
Discrete Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hui-Juan Wang, Jian-Liang Wu |
A note on the total coloring of planar graphs without adjacent 4-cycles. |
Discrete Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Jian-Feng Hou, Lukasz Kowalik, Borut Luzar, Jian-Liang Wu |
A Planar linear arboricity conjecture. |
Journal of Graph Theory |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Bing Wang, Jian-Liang Wu |
Total coloring of planar graphs with maximum degree 7. |
Inf. Process. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Xin Zhang, Jian-Liang Wu |
On edge colorings of 1-planar graphs. |
Inf. Process. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hao Fan, H. A. Kierstead, Guizhen Liu, Theodore Molla, Jian-Liang Wu, Xin Zhang |
A note on relaxed equitable coloring of graphs. |
Inf. Process. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bing Wang, Jian-Liang Wu |
Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Xin Zhang, Jian-Liang Wu |
On equitable and equitable list colorings of series-parallel graphs. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Xin Zhang, Jian-Liang Wu, Guizhen Liu |
New Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree. |
Discrete Mathematics & Theoretical Computer Science |
2011 |
DBLP BibTeX RDF |
|
| 1 | Xin Zhang, Guizhen Liu, Jian-Liang Wu |
(1,λ)-embedded graphs and the acyclic edge choosability |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Xin Zhang, Guizhen Liu, Jian-Liang Wu |
Edge covering pseudo-outerplanar graphs with forests |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Xin Zhang, Guizhen Liu, Jian-Liang Wu |
k-forested choosability of graphs with bounded maximum average degree |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Xin Zhang, Guizhen Liu, Jian-Liang Wu |
Edge Coloring of Triangle-Free 1-Planar Graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Xin Zhang, Jian-Liang Wu, Jin Yan |
Degree conditions for the partition of a graph into triangles and quadrilaterals |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Lian-Cui Zuo, Qinglin Yu, Jian-Liang Wu |
Vertex arboricity of integer distance graph G(Dm, k). |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Qin Ma, Jian-Liang Wu, Xiao Yu |
Planar graphs without 5-cycles or without 6-cycles. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jian-Liang Wu |
The Linear Arboricity of Graphs on Surfaces of Negative Euler Characteristic. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jian-Liang Wu, Yu-Wen Wu |
The linear arboricity of planar graphs of maximum degree seven is four. |
Journal of Graph Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jian-Liang Wu, Yu-Liang Wu |
The Vertex Linear Arboricity of Claw-Free Graphs with Small Degree. |
Ars Comb. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Jian-Liang Wu, Ping Wang |
A Linear Algorithm for Edge-Face Coloring Series-Parallel Graphs. |
International Conference on Computational Science |
2007 |
DBLP DOI BibTeX RDF |
edge-face coloring, series-parallel graph, decomposition tree |
| 1 | Lian-Cui Zuo, Jian-Liang Wu, Jia-Zhuang Liu |
The Vertex Linear Arboricity of an Integer Distance Graph with a Special Distance Set. |
Ars Comb. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Lian-Cui Zuo, Jian-Liang Wu, Jia-Zhuang Liu |
The Fractional Vertex Linear Arboricity of Graphs. |
Ars Comb. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Jian-Liang Wu, Ping Wang, Anthony J. W. Hilton |
Two sufficient conditions for a graph to be type 1. |
Ars Comb. |
2005 |
DBLP BibTeX RDF |
|
| 1 | Peter Dankelmann, Ortrud Oellermann, Jian-Liang Wu |
Minimum average distance of strong orientations of graphs. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jian-Liang Wu, Daiqiang Hu |
Total Coloring of Series-Parallel Graphs. |
Ars Comb. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Lian-ying Miao, Shi-you Pang, Jian-liang Wu |
An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Lian-ying Miao, Jian-liang Wu |
Edge-coloring critical graphs with high degree. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #27 of 27 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")