Title

Generalized K-Tuple Colorings of Cycles and Other Graphs

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

J. Comb. Theory Ser. B

Keywords

Mathematics

Abstract

Stahl's concept of k-tuple coloring the nodes of a graph is extended to specify that adjacent nodes must have i colors in common. Complete results for a minimum such coloring are obtained for bipartite graphs and odd cycles. Partial results are shown for complete graphs.

Journal Title

Journal of Combinatorial Theory Series B

Volume

32

Issue/Number

1

Publication Date

1-1-1982

Document Type

Article

Language

English

First Page

90

Last Page

94

WOS Identifier

WOS:A1982NK96500008

ISSN

0095-8956

Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Citation Indexes: 11
  • Usage
    • Abstract Views: 4
  • Captures
    • Readers: 2
see details

Share

COinS