Paper Info
Title
Distinguishing Chromatic Numbers of Bipartite Graphs
Abstract
Extending the work of K.L. Collins and A.N. Trenk, we characterize connected bipartite graphs with large distinguishing chromatic number. In particular, if G is a connected bipartite graph with maximum degree Delta >= 3, then chi(D)(G) <= 2 Delta - 2 whenever G not congruent to K-Delta-1,K-Delta,K- K-Delta,K-Delta.
Year
Venue
Keywords
2009
ELECTRONIC JOURNAL OF COMBINATORICS
maximum degree,bipartite graph
Field
DocType
Volume
Discrete mathematics,Combinatorics,Chromatic scale,Bipartite graph,Degree (graph theory),Mathematics
Journal
16.0
Issue
ISSN
Citations 
1.0
1077-8926
5
PageRank 
References 
Authors
0.57
2
2
Name
Order
Citations
PageRank
C. Laflamme116921.28
K. Seyffarth210118.88