JOURNAL ARTICLE
E-Total Coloring of Complete Bipartite Graphs
Year: 2024 Journal: Springer Link (Chiba Institute of Technology) Publisher: Chiba Institute of Technology
Abstract
\nIn this study, using the method of contradiction and the pre-assignment of chromatic sets, we discuss the E-total coloring of complete bipartite graphs K5,n (5≤n≤7 113) which are vertex-distinguished by multiple sets. The vertex-distinguishing E-total chromatic numbers of this kind of graph are determined. \n
Keywords:
Bipartite graph Edge coloring Graph coloring Brooks' theorem Chromatic scale Graph Total coloring Fractional coloring
Metrics
0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
0
Refs
0.46
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Topics
Diverse Scientific and Economic Studies
Social Sciences → Economics, Econometrics and Finance → Economics and Econometrics
Legal Cases and Commentary
Health Sciences → Medicine → Reproductive Medicine
Related Documents
JOURNAL ARTICLE
Coloring complete bipartite graphs from random lists
Michael KrivelevichAsaf Nachmias
Journal: Random Structures and Algorithms Year: 2005 Vol: 29 (4)Pages: 436-449
JOURNAL ARTICLE
LIST COLORING OF BLOCK GRAPHS AND COMPLETE BIPARTITE GRAPHS
Journal: World Science Year: 2021
JOURNAL ARTICLE
Coloring Complete and Complete Bipartite Graphs from Random Lists
Carl Johan CasselgrenRoland Häggkvist
Journal: Graphs and Combinatorics Year: 2015 Vol: 32 (2)Pages: 533-542
JOURNAL ARTICLE
FACIAL TOTAL-COLORING OF BIPARTITE PLANE GRAPHS
Journal: International Journal of Pure and Apllied Mathematics Year: 2017 Vol: 115 (1)
JOURNAL ARTICLE
On acyclic edge-coloring of complete bipartite graphs
Ayineedi VenkateswarluSantanu SarkarSai Mali Ananthanarayanan
Journal: Discrete Mathematics Year: 2016 Vol: 340 (3)Pages: 481-493