b-coloring and b-edge coloring of Mesh Graphs and their related graphs

Yue Peng

doi:10.1117/12.2672201

28 March 2023 b-coloring and b-edge coloring of mesh graphs and their related graphs

Yue Peng

Proceedings Volume 12597, Second International Conference on Statistics, Applied Mathematics, and Computing Science (CSAMCS 2022); 1259733 (2023) https://doi.org/10.1117/12.2672201
Event: Second International Conference on Statistics, Applied Mathematics, and Computing Science (CSAMCS 2022), 2022, Nanjing, China

Abstract

In the normal coloring of a graph, if there is at least one vertex in each color class and it has at least one adjacent point in other color classes, such normal coloring is called b - coloring, and such points are called b - points. Let G have the maximum k value of b - k -dyeing called b -chromatic number, which is recorded as φ(G). Similarly, b -edge coloring and the chromatic number of the graph is φ'(G).

Citation Download Citation

Yue Peng "b-coloring and b-edge coloring of mesh graphs and their related graphs", Proc. SPIE 12597, Second International Conference on Statistics, Applied Mathematics, and Computing Science (CSAMCS 2022), 1259733 (28 March 2023); https://doi.org/10.1117/12.2672201

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available