The incidence coloring number of Halin graphs and outerplanar graphs

Authors:
Shu-Dong Wang;Dong-Ling Chen;Shan-Chen Pang
Affiliations:
Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan, and College of Information Science and Engineering, Shandong University of Science and Technolo ...;College of Information Science and Engineering, Shandong and University of Science and Technology, Shandong, People's Republic of China;College of Information Science and Engineering, Shandong University of Science and Technology, Shandong, People's Republic of China
Venue:
Discrete Mathematics
Year:
2002

Citing 4
Cited 4

The star arboricity of graphs

Discrete Mathematics
Incidence and strong edge colorings of graphs

Discrete Mathematics
On incidence coloring and star arboricity of graphs

Discrete Mathematics
Graph Theory With Applications

Graph Theory With Applications

The incidence game chromatic number

Discrete Applied Mathematics
Interval wavelength assignment in all-optical star networks

PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
The incidence game chromatic number of paths and subgraphs of wheels

Discrete Applied Mathematics
Interval incidence coloring of bipartite graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.05

Visualization

Abstract

In this paper, we shall prove that the incidence coloring number for Halin graphs of maximum degree greater than or equal to 5 and outerplanar graphs of maximum degree greater than or equal to 4 is equal to the maximum degree of the graph plus 1.