Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Burris, R. Schelp (1997)
Vertex-distinguishing proper edge-coloringsJ. Graph Theory, 26
P.N. Balister, B. Bollobás, R.H. Schelp (2002)
Vertex distinguishing colorings of graphs with Δ(G) = 2Discrete Mathematics, 252
Manoel Lemos, J. Oxley (2003)
On removable cycles through every edgeJournal of Graph Theory, 42
J. A. Bondy (1976)
Murty, U.S.R. graph theory with applications
X.E. Chen (2004)
Adjacent vertex distinguishing total chromatic numbers on K 2n+1 − E(P 3)International Journal of Pure and Applied Mathematics, 13
C. Bazgan, A. Harkat-Benhamdine, H. Li, M. Woźniak (1999)
On the vertex-distinguishing edge colorings of graphsJ. Combin. Theory, 75
X.E. Chen, Z.F. Zhang, Y.R. Sun (2005)
Adjacent vertex distinguishing total chromatic numbers on mono-cycle graphs and the square of cyclesInternational Journal of Pure and Applied Mathematics, 18
E. Lloyd, J. Bondy, U. Murty (1978)
Graph Theory with Applications
C. Bazgan, Amel Harkat-Benhamdine, Hao Li, M. Wozniak (1999)
On the Vertex-Distinguishing Proper Edge-Colorings of GraphsJ. Comb. Theory, Ser. B, 75
Zhongfu Zhang, Linzhong Liu (1997)
On the complete chromatic number of Halin graphsActa Mathematicae Applicatae Sinica, 13
Zhongfu Zhang, Xiangen Chen, Jingwen Li, B. Yao, Xinzhong Lu, Jianfang Wang (2005)
On adjacent-vertex-distinguishing total coloring of graphsScience in China Series A: Mathematics, 48
P. Hansen, O. Marcotte (1999)
Graph colouring and applications, 23
Zhongfu Zhang, Linzhong Liu, Jianfang Wang (2002)
Adjacent strong edge coloring of graphsAppl. Math. Lett., 15
Zhang Gui-cang (2005)
Adjacent-vertex-distinguishing total chromatic numbers on Mycielski's graphs of several kinds of particular graphsJournal of Lanzhou University
P. Balister, B. Bollobás, R. Schelp (2002)
Vertex distinguishing colorings of graphs with Delta(G)=2Discret. Math., 252
R. Halin (1971)
Combinatorial mathematics and its applications
P.N. Balister, O.M. Riordan, R.H. Schelp (2003)
Vertex-distinguishing edge colorings of graphsJ. Graph Theory, 42
In a paper by Zhang and Chen et al.(see [11]), a conjecture was made concerning the minimum number of colors χ at (G) required in a proper total-coloring of G so that any two adjacent vertices have different color sets, where the color set of a vertex ν is the set composed of the color of ν and the colors incident to ν. We find the exact values of χ at (G) and thus verify the conjecture when G is a Generalized Halin graph with maximum degree at least 6. A generalized Halin graph is a 2-connected plane graph G such that removing all the edges of the boundary of the exterior face of G (the degrees of the vertices in the boundary of exterior face of G are all three) gives a tree.
Acta Mathematicae Applicatae Sinica – Springer Journals
Published: Mar 13, 2008
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.