UPM Institutional Repository

The chromaticity of s-bridge graphs and related graphs


Citation

Xu, Shaoji and Liu, Jinjie and Peng, Yeehock (1994) The chromaticity of s-bridge graphs and related graphs. Discrete Mathematics, 135 (1-3). pp. 349-358. ISSN 0012-365X; eISSN: 0012-365X

Abstract

The graph consisting of s paths joining two vertices is called s-bridge graph. In this paper, we discuss the chromaticity of some families of s-bridge graphs, especially 4-bridge graphs, and some graphs related to s-bridge graphs.


Download File

[img] Text
115783.pdf - Published Version

Download (528kB)

Additional Metadata

Item Type: Article
Divisions: Universiti Pertanian Malaysia
DOI Number: https://doi.org/10.1016/0012-365X(93)E0091-H
Publisher: Elsevier
Keywords: S-bridge graphs; Chromaticity; 4-bridge graphs; Graph theory; Graph coloring; Path graphs
Depositing User: Ms. Zaimah Saiful Yazan
Date Deposited: 12 Mar 2025 00:47
Last Modified: 12 Mar 2025 00:47
Altmetrics: http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1016/0012-365X(93)E0091-H
URI: http://psasir.upm.edu.my/id/eprint/115783
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item