GRAPHS WITH LEAST NUMBER OF COLORINGS

被引：5
|
作者：
SAKALOGLU, A
SATYANARAYANA, A
机构：
[1] Department of Electrical Engineering, Computer Science Stvens Institute of Technology, Hoboken, New Jersey
来源：
JOURNAL OF GRAPH THEORY | 1995年 / 19卷 / 04期
关键词：
D O I：
10.1002/jgt.3190190407
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A lambda-coloring of a graph G is an assignment of lambda or fewer colors to the points of G so that no two adjacent points have the same color. Let Omega(n,e) be the collection of all connected n-point and e-edge graphs and let Omega p(n, e) be the planar graphs of Omega(n, e). This paper characterizes the graphs that minimize the number of lambda-colorings in Omega(n, e) for all lambda greater than or equal to 1 and Omega p(n, e) for all lambda > 4. (C) 1995 John Wiley & Sons, Inc.
引用
收藏
页码：523 / 533
页数：11
相关论文
共 50 条
  • [21] Proper Distinguishing Colorings with Few Colors for Graphs with Girth at Least 5
    Cranston, Daniel W.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2018, 25 (03):
  • [22] THE TWO-COLORING NUMBER AND DEGENERATE COLORINGS OF PLANAR GRAPHS
    Kierstead, Hal
    Mohar, Bojan
    Spacapan, Simon
    Yang, Daqing
    Zhu, Xuding
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2009, 23 (03) : 1548 - 1560
  • [23] Injective edge colorings of degenerate graphs and the oriented chromatic number
    Bradshaw, Peter
    Clow, Alexander
    Xu, Jingwei
    EUROPEAN JOURNAL OF COMBINATORICS, 2025, 127
  • [24] On the Number of Heterochromatic Trees in Nice and Beautiful Colorings of Complete Graphs
    Montellano-Ballesteros, Juan Jose
    Rivera-Campo, Eduardo
    Strausz, Ricardo
    GRAPHS AND COMBINATORICS, 2022, 38 (01)
  • [25] The maximum number of colorings of graphs of given order and size: A survey
    Lazebnik, Felix
    DISCRETE MATHEMATICS, 2019, 342 (10) : 2783 - 2791
  • [26] On the Number of Heterochromatic Trees in Nice and Beautiful Colorings of Complete Graphs
    Juan José Montellano-Ballesteros
    Eduardo Rivera-Campo
    Ricardo Strausz
    Graphs and Combinatorics, 2022, 38
  • [27] On the number of maximal independent sets in minimum colorings of split graphs
    Bresar, Bostjan
    Movarraei, Nazanin
    DISCRETE APPLIED MATHEMATICS, 2018, 247 : 352 - 356
  • [28] Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five
    Yan, Chengchao
    Huang, Danjun
    Chen, Dong
    Wang, Weifan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 28 (04) : 893 - 909
  • [29] Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five
    Chengchao Yan
    Danjun Huang
    Dong Chen
    Weifan Wang
    Journal of Combinatorial Optimization, 2014, 28 : 893 - 909
  • [30] Neighbor sum distinguishing total colorings of planar graphs with girth at least 5
    Li, Jianguo
    Ge, Shan
    Xu, Changqing
    UTILITAS MATHEMATICA, 2017, 104 : 115 - 121
12345