Geodesic
Self 2-distance Graphs
Canadian mathematical bulletin, Tome 60 (2017) no. 1, pp. 26-42

Voir la notice de l'article provenant de la source Cambridge University Press

All finite simple self 2-distance graphs with no square, diamond, or triangles with a common vertex as subgraph are determined. Utilizing these results, it is shown that there is no cubic self 2-distance graph.
DOI : 10.4153/CMB-2016-071-6
Mots-clés : 05C12, 05C60, 05C76, distance graph, regular graph, forbidden subgraph 
Azimi, Ali; Ghouchan, Mohammad Farrokhi Derakhshandeh. Self 2-distance Graphs. Canadian mathematical bulletin, Tome 60 (2017) no. 1, pp. 26-42. doi: 10.4153/CMB-2016-071-6
@article{10_4153_CMB_2016_071_6,
     author = {Azimi, Ali and Ghouchan, Mohammad Farrokhi Derakhshandeh},
     title = {Self 2-distance {Graphs}},
     journal = {Canadian mathematical bulletin},
     pages = {26--42},
     year = {2017},
     volume = {60},
     number = {1},
     doi = {10.4153/CMB-2016-071-6},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-2016-071-6/}
}
TY  - JOUR
AU  - Azimi, Ali
AU  - Ghouchan, Mohammad Farrokhi Derakhshandeh
TI  - Self 2-distance Graphs
JO  - Canadian mathematical bulletin
PY  - 2017
SP  - 26
EP  - 42
VL  - 60
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-2016-071-6/
DO  - 10.4153/CMB-2016-071-6
ID  - 10_4153_CMB_2016_071_6
ER  - 
%0 Journal Article
%A Azimi, Ali
%A Ghouchan, Mohammad Farrokhi Derakhshandeh
%T Self 2-distance Graphs
%J Canadian mathematical bulletin
%D 2017
%P 26-42
%V 60
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-2016-071-6/
%R 10.4153/CMB-2016-071-6
%F 10_4153_CMB_2016_071_6

[1] [1] Azimi, A. and Farrokhi, M. D. G., Simple graphs whose 2-distance graphs are paths or cycles. Matematiche (Catania) 69(2014), no. 2,183-191. Google Scholar

[2] [2] Chilakamarri, K. B., The unit-distance graph problem: a brief survey and some new results. Bull. Inst. Combin. Appl. 8(1993), 39–60. Google Scholar

[3] [3] Eggleton, R. B., P. Erdôs, and Skilton, D. K., Colouring the real line. J. Combin. Theory, Ser. B 39(1985), no. 1, 86–100. http://dx.doi.Org/10.101 6/0095-8956(85)90039-5 Google Scholar

[4] [4] Hadwiger, H., Debrunner, H., and Klee, V., Combinatorial geometry in the plane. Holt, Rinehart and Winston, New York, 1964. Google Scholar

[5] [5] Kramer, F. and Kramer, H., A survey on the distance-colouring of graphs. Discrete Math. 308(2008), no. 2-3, 422–426. http://dx.doi.Org/10.1 01 6/j.disc.2006.11.059 Google Scholar

[6] [6] Liu, D. D., From rainbow to the lonely runner: a survey on coloring parameters of distance graphs. Taiwanese J. Math. 12(2008), no. 4, 851–871. Google Scholar

[7] [7] Moser, L. and W. Moser, Solution to problem 10. Canad. Math. Bull. 4(1961), 187–189. Google Scholar

[8] [8] Seidel, J. J., A survey of two-graphs. In: Colloquio Internazionale sulle Teorie Combinatorie (Rome, 1973), Atti dei Convegni Lincei, 17, Acad. Naz. Lincei, Rome, 1976, pp. 481–511. Google Scholar

[9] [9] Simic, S. K., Graph equations for line graphs and n-distance graphs. Publ. Inst. Math. (Beograd) 33(47)(1983), 203–216. Google Scholar

[10] [10] Soifer, A., The mathematical coloring book: mathematics of coloring and the colorful life of its creators. Springer, New York, 2009. Google Scholar

Cité par Sources :