()-total choosability of planar graphs with no cycles of length from 4 to and without close triangles (English)
- New search for: Chang, Gerard J.
- New search for: Roussel, Nicolas
- New search for: Chang, Gerard J.
- New search for: Roussel, Nicolas
In:
Discrete Mathematics
;
312
, 14
;
2126-2130
;
2011
-
ISSN:
- Article (Journal) / Electronic Resource
-
Title:()-total choosability of planar graphs with no cycles of length from 4 to and without close triangles
-
Contributors:Chang, Gerard J. ( author ) / Roussel, Nicolas ( author )
-
Published in:Discrete Mathematics ; 312, 14 ; 2126-2130
-
Publisher:
- New search for: Elsevier B.V.
-
Publication date:2011-01-01
-
Size:5 pages
-
ISSN:
-
DOI:
-
Type of media:Article (Journal)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents – Volume 312, Issue 14
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 2091
-
PrefaceKalinowski, Rafał / Pilśniak, Monika / Woźniak, Mariusz et al. | 2012
- 2092
-
Richard Schelp (1936–2010)| 2012
- 2096
-
The crossing number ofKlešč, Marián / Kravecová, Daniela et al. | 2011
- 2096
-
The crossing number ofKlešč, Marián et al. | 2012
- 2102
-
Vertex coloring without large polychromatic starsBujtás, Csilla / Sampathkumar, E. / Tuza, Zsolt / Dominic, Charles / Pushpalatha, L. et al. | 2011
- 2109
-
On vertex stable graphs with minimum sizeFouquet, J.-L. / Thuillier, H. / Vanherpe, J.-M. / Wojda, A.P. et al. | 2011
- 2109
-
On vertex stable graphs with minimum sizeFouquet, J.-L. et al. | 2012
- 2119
-
Dense uniform hypergraphs have high list chromatic numberAlon, Noga / Kostochka, Alexandr et al. | 2011
- 2126
-
(D+1)-total choosability of planar graphs with no cycles of length from 4 to k and without close trianglesChang, G. J. / Roussel, N. et al. | 2012
- 2126
-
()-total choosability of planar graphs with no cycles of length from 4 to and without close trianglesChang, Gerard J. et al. | 2012
- 2126
-
()-total choosability of planar graphs with no cycles of length from 4 to and without close trianglesChang, Gerard J. / Roussel, Nicolas et al. | 2011
- 2131
-
Circuits of length 5 in 2-factors of cubic graphsLukot’ka, R. / Máčajová, E. / Mazák, J. / Škoviera, M. et al. | 2011
- 2135
-
On geometrically realizable Möbius triangulationsNakamoto, Atsuhiro / Tsuchiya, Shoichi et al. | 2011
- 2135
-
On geometrically realizable Mobius triangulationsNakamoto, A. / Tsuchiya, S. et al. | 2012
- 2140
-
Improved degree conditions for Hamiltonian propertiesKemnitz, Arnfried / Schiermeyer, Ingo et al. | 2011
- 2146
-
Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphsBorowiecki, Mieczysław / Drgas-Burchardt, Ewa et al. | 2011
- 2153
-
The pre-hull number and lexicographic productPeterin, Iztok et al. | 2011
- 2158
-
Some Ramsey–Turán type problems and related questionsSchelp, R.H. et al. | 2011
- 2158
-
Some Ramsey-Turan type problems and related questionsSchelp, R. H. et al. | 2012
- 2162
-
Weighted-1-antimagic graphs of prime power orderHuang, Po-Yi / Wong, Tsai-Lien / Zhu, Xuding et al. | 2011
- 2170
-
A special antidilation problem for meshes and Hamming graphsTörök, L’ubomír / Vrt’o, Imrich et al. | 2011
- 2177
-
Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphsKužel, Roman / Ryjáček, Zdeněk / Teska, Jakub / Vrána, Petr et al. | 2012
- 2190
-
An implicit degree condition for hamiltonian graphsLi, Hao / Ning, Wantao / Cai, Junqing et al. | 2012