Optimal Backbone Coloring of Split Graphs with Matching Backbones
For a graph G with a given subgraph H, the backbone coloring is defined as the mapping c : V (G) → N+ such that |c(u) − c(v)| ≥ 2 for each edge {u, v} ∈ E(H) and |c(u) − c(v)| ≥ 1 for each edge {u, v} ∈ E(G). The backbone chromatic number BBC(G,H) is the smallest integer k such that there exists a b...
Wedi'i Gadw mewn:
| Prif Awdur: | |
|---|---|
| Fformat: | Artigo |
| Iaith: | Inglês |
| Cyhoeddwyd: |
University of Zielona Góra
2015-02-01
|
| Cyfres: | Discussiones Mathematicae Graph Theory |
| Pynciau: | |
| Mynediad Ar-lein: | https://doi.org/10.7151/dmgt.1786 |
| Tagiau: |
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|