On distance local connectivity and vertex distance colouring
Přemysl Holub
Discussiones Mathematicae Graph Theory, Tome 27 (2007), p. 209-227 / Harvested from The Polish Digital Mathematics Library

In this paper, we give some sufficient conditions for distance local connectivity of a graph, and a degree condition for local connectivity of a k-connected graph with large diameter. We study some relationships between t-distance chromatic number and distance local connectivity of a graph and give an upper bound on the t-distance chromatic number of a k-connected graph with diameter d.

Publié le : 2007-01-01
EUDML-ID : urn:eudml:doc:270169
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1356,
     author = {P\v remysl Holub},
     title = {On distance local connectivity and vertex distance colouring},
     journal = {Discussiones Mathematicae Graph Theory},
     volume = {27},
     year = {2007},
     pages = {209-227},
     zbl = {1189.05148},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1356}
}
Přemysl Holub. On distance local connectivity and vertex distance colouring. Discussiones Mathematicae Graph Theory, Tome 27 (2007) pp. 209-227. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1356/

[000] [1] P. Baldi, On a generalized family of colourings, Graphs Combin. 6 (1990) 95-110, doi: 10.1007/BF01787722. | Zbl 0716.05018

[001] [2] J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (Macmillan, London and Elsevier, 1976). | Zbl 1226.05083

[002] [3] G. Chartrand and R.E. Pippert, Locally connected graphs, Cas. pro pestování matematiky 99 (1974) 158-163. | Zbl 0278.05113

[003] [4] A. Chen, A. Gyárfás and R.H. Schelp, Vertex coloring with a distance restriction, Discrete Math. 191 (1998) 83-90, doi: 10.1016/S0012-365X(98)00094-6. | Zbl 0958.05053

[004] [5] P. Holub and L. Xiong, On Distance local connectivity and the hamiltonian index, submitted to Discrete Math. | Zbl 1285.05105

[005] [6] S. Jendrol' and Z. Skupień, Local structures in plane maps and distance colourings, Discrete Math. 236 (2001) 167-177, doi: 10.1016/S0012-365X(00)00440-4. | Zbl 0990.05043

[006] [7] F. Kramer and H. Kramer, Un problème de coloration des sommets d'un graphe, C.R. Acad. Sci. Paris Sér. A-B 268 (1969) A46-A48. | Zbl 0165.57302

[007] [8] F. Kramer and H. Kramer H, On the generalized chromatic number, Ann. Discrete Math. 30 (1986) 275-284. | Zbl 0601.05020

[008] [9] T. Madaras and A. Marcinová, On the structural result on normal plane maps, Discuss. Math. Graph Theory 22 (2002) 293-303, doi: 10.7151/dmgt.1176. | Zbl 1027.05028

[009] [10] Z. Ryjácek, On a closure concept in claw-free graphs, J. Combin. Theory (B) 70 (1997) 217-224, doi: 10.1006/jctb.1996.1732. | Zbl 0872.05032

[010] [11] Z. Skupień, Some maximum multigraphs and edge/vertex distance colourings, Discuss. Math. Graph Theory 15 (1995) 89-106, doi: 10.7151/dmgt.1010. | Zbl 0833.05036