|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1 occurrences of 1 keywords
|
|
|
|
|
Results
Found 31 publication records. Showing 31 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Lee Williams, Jennifer Vandenbussche, Gexin Yu |
Equitable defective coloring of sparse planar graphs.  |
Discrete Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Rong Luo, Rui Xu, Gexin Yu |
An extremal problem on group connectivity of graphs. |
Eur. J. Comb. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel W. Cranston, Gexin Yu |
Linear choosability of sparse graphs. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel W. Cranston, Seog-Jin Kim, Gexin Yu |
Injective Colorings of Graphs with Low Average Degree. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Chase Albert, Chi-Kwong Li, Gilbert Strang, Gexin Yu |
Permutations as Product of Parallel Transpositions. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yifan Zhang, Qun Li, Gexin Yu, Baosheng Wang |
ETCH: Efficient Channel Hopping for communication rendezvous in dynamic spectrum access networks. |
INFOCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel W. Cranston, Seog-Jin Kim, Gexin Yu |
Injective colorings of sparse graphs. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel W. Cranston, Gexin Yu |
A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Daniel W. Cranston, Seog-Jin Kim, Gexin Yu |
Injective colorings of graphs with low average degree |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Rong Luo, Jean-Sébastien Sereni, D. Christopher Stephens, Gexin Yu |
Equitable Coloring of Sparse Planar Graphs. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr V. Kostochka, Gexin Yu |
Ore-type conditions implying 2-factors consisting of short cycles. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel W. Cranston, Gexin Yu |
A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid. |
Electr. J. Comb. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Jennifer Vandenbussche, Douglas B. West, Gexin Yu |
On the Pagenumber of k-Trees. |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg V. Borodin, Alexandr V. Kostochka, Naeem N. Sheikh, Gexin Yu |
M-degrees of quadrangle-free planar graphs. |
Journal of Graph Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Qi Liu, Douglas B. West, Gexin Yu |
Implications among linkage properties in graphs. |
Journal of Graph Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hong-Jian Lai, Yehong Shao, Gexin Yu, Mingquan Zhan |
Hamiltonian connectedness in 3-connected line graphs. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr V. Kostochka, Gexin Yu |
Packing of graphs with small product of sizes. |
J. Comb. Theory, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg V. Borodin, Alexandr V. Kostochka, Naeem N. Sheikh, Gexin Yu |
Decomposing a planar graph with girth 9 into a forest and a matching. |
Eur. J. Comb. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rong Luo, Rui Xu, Jianhua Yin, Gexin Yu |
Ore-condition and Z3-connectivity. |
Eur. J. Comb. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hemanshu Kaul, Alexandr V. Kostochka, Gexin Yu |
On a graph packing conjecture by Bollobás, Eldridge and Catlin. |
Combinatorica |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 05C35, 05C70 |
| 1 | József Balogh, Stephen G. Hartke, Qi Liu, Gexin Yu |
On the First-Fit Chromatic Number of Graphs. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr V. Kostochka, Gexin Yu |
Ore-type degree conditions for a graph to be H-linked. |
Journal of Graph Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr V. Kostochka, Gexin Yu |
Minimum degree conditions for H-linked graphs. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hong-Jian Lai, Xiangwen Li, Gexin Yu |
An inequality for the group chromatic number of a graph. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr V. Kostochka, Gexin Yu |
Ore-type graph packing problems. |
Combinatorics, Probability & Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr V. Kostochka, Gexin Yu |
An Ore-type analogue of the Sauer-Spencer Theorem. |
Graphs and Combinatorics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Matt DeVos, Rui Xu, Gexin Yu |
Nowhere-zero Z3-flows through Z3-connectivity. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Alexandr V. Kostochka, Gexin Yu |
On Sufficient Degree Conditions for a Graph to be k-linked. |
Combinatorics, Probability & Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald J. Gould, Alexandr V. Kostochka, Gexin Yu |
On Minimum Degree Implying That a Graph is H-Linked. |
SIAM J. Discrete Math. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr V. Kostochka, Gexin Yu |
Minimum degree conditions for H-linked graphs. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr V. Kostochka, Gexin Yu |
An extremal problem for H-linked graphs. |
Journal of Graph Theory |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #31 of 31 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")