A study of the total chromatic number of equibipartite graphs

Bor Liang Chen; Chun Kan Cheng; Hung-Lin Fu; Kuo Ching Huang

doi:10.1016/S0012-365X(97)00160-X

A study of the total chromatic number of equibipartite graphs

Bor Liang Chen^*, Chun Kan Cheng, Hung-Lin Fu, Kuo Ching Huang

^*Corresponding author for this work

Department of Applied Mathematics

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

The total chromatic number χ_t(G) of a graph G is the least number of colors needed to color the vertices and edges of G so that no adjacent vertices or edges receive the same color, no incident edges receive the same color as either of the vertices it is incident with. In this paper, we obtain some results of the total chromatic number of the equibipartite graphs of order 2n with maximum degree n - 1. As a part of our results, we disprove the biconformability conjecture.

Original language	English
Pages (from-to)	49-60
Number of pages	12
Journal	Discrete Mathematics
Volume	184
Issue number	1-3
DOIs	https://doi.org/10.1016/S0012-365X(97)00160-X
State	Published - 6 Apr 1998

Access to Document

10.1016/S0012-365X(97)00160-X

Fingerprint Dive into the research topics of 'A study of the total chromatic number of equibipartite graphs'. Together they form a unique fingerprint.

Cite this

@article{a3f3d14f1258419ca9c7a94734287bf1,

title = "A study of the total chromatic number of equibipartite graphs",

abstract = "The total chromatic number χt(G) of a graph G is the least number of colors needed to color the vertices and edges of G so that no adjacent vertices or edges receive the same color, no incident edges receive the same color as either of the vertices it is incident with. In this paper, we obtain some results of the total chromatic number of the equibipartite graphs of order 2n with maximum degree n - 1. As a part of our results, we disprove the biconformability conjecture.",

author = "Chen, {Bor Liang} and Cheng, {Chun Kan} and Hung-Lin Fu and Huang, {Kuo Ching}",

year = "1998",

month = apr,

day = "6",

doi = "10.1016/S0012-365X(97)00160-X",

language = "English",

volume = "184",

pages = "49--60",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - A study of the total chromatic number of equibipartite graphs

AU - Chen, Bor Liang

AU - Cheng, Chun Kan

AU - Fu, Hung-Lin

AU - Huang, Kuo Ching

PY - 1998/4/6

Y1 - 1998/4/6

N2 - The total chromatic number χt(G) of a graph G is the least number of colors needed to color the vertices and edges of G so that no adjacent vertices or edges receive the same color, no incident edges receive the same color as either of the vertices it is incident with. In this paper, we obtain some results of the total chromatic number of the equibipartite graphs of order 2n with maximum degree n - 1. As a part of our results, we disprove the biconformability conjecture.

AB - The total chromatic number χt(G) of a graph G is the least number of colors needed to color the vertices and edges of G so that no adjacent vertices or edges receive the same color, no incident edges receive the same color as either of the vertices it is incident with. In this paper, we obtain some results of the total chromatic number of the equibipartite graphs of order 2n with maximum degree n - 1. As a part of our results, we disprove the biconformability conjecture.

UR - http://www.scopus.com/inward/record.url?scp=0041494555&partnerID=8YFLogxK

U2 - 10.1016/S0012-365X(97)00160-X

DO - 10.1016/S0012-365X(97)00160-X

M3 - Article

AN - SCOPUS:0041494555

VL - 184

SP - 49

EP - 60

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -