MINIMAL 5-CHROMATIC TRIANGLE-FREE GRAPHS

被引：1
|
作者：
AVIS, D
机构：
来源：
JOURNAL OF GRAPH THEORY | 1979年 / 3卷 / 04期
关键词：
D O I：
10.1002/jgt.3190030411
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：397 / 400
页数：4
相关论文
共 50 条
  • [21] On the chromatic index of join graphs and triangle-free graphs with large maximum degree
    Zorzi, A.
    Zatesko, L. M.
    DISCRETE APPLIED MATHEMATICS, 2018, 245 : 183 - 189
  • [22] A triangle-free circle graph with chromatic number 5
    Ageev, AA
    DISCRETE MATHEMATICS, 1996, 152 (1-3) : 295 - 298
  • [23] Acyclic Chromatic Index of Triangle-free 1-Planar Graphs
    Chen, Jijuan
    Wang, Tao
    Zhang, Huiqin
    GRAPHS AND COMBINATORICS, 2017, 33 (04) : 859 - 868
  • [24] Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree
    Xiao Wang
    Baoyindureng Wu
    Journal of Combinatorial Optimization, 2017, 33 : 28 - 34
  • [25] AN UPPER BOUND ON THE FRACTIONAL CHROMATIC NUMBER OF TRIANGLE-FREE SUBCUBIC GRAPHS
    Liu, Chun-Hung
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2014, 28 (03) : 1102 - 1136
  • [26] Triangle-free intersection graphs of line segments with large chromatic number
    Pawlik, Arkadiusz
    Kozik, Jakub
    Krawczyk, Tomasz
    Lason, Michal
    Micek, Piotr
    Trotter, William T.
    Walczak, Bartosz
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2014, 105 : 6 - 10
  • [27] Properties of Descartes' construction of triangle-free graphs with high chromatic number
    Kostochka, AV
    Nesetril, J
    COMBINATORICS PROBABILITY & COMPUTING, 1999, 8 (05): : 467 - 472
  • [28] LINE-CHROMATIC NUMBER OF TRIANGLE-FREE GRAPHS - PRELIMINARY REPORT
    KRONK, HVE
    RADLOWSK.M
    TRANEN, B
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1974, 21 (02): : A291 - A291
  • [29] 5-chromatic strongly regular graphs
    Fiala, Nick C.
    Haemers, Willem H.
    DISCRETE MATHEMATICS, 2006, 306 (23) : 3083 - 3096
  • [30] Acyclic Chromatic Index of Triangle-free 1-Planar Graphs
    Jijuan Chen
    Tao Wang
    Huiqin Zhang
    Graphs and Combinatorics, 2017, 33 : 859 - 868
12345