The Chromatic Index of Projective Triple Systems

被引：4
作者：
Meszka, Mariusz [1 ]
机构：
[1] AGH Univ Sci & Technol, Krakow, Poland
来源：
JOURNAL OF COMBINATORIAL DESIGNS | 2013年 / 21卷 / 11期
关键词：
projective triple system; block coloring; chromatic index;
D O I：
10.1002/jcd.21368
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We prove that, for even m, the chromatic index of the projective triple system STS(2(m+1) - 1) equals 2(m) + 2. (C) 2013 Wiley Periodicals, Inc.
引用
收藏
页码：531 / 540
页数：10
相关论文
共 46 条
  • [21] The Maximum Chromatic Index of Multigraphs with Given Δ and μ
    Diego Scheide
    Michael Stiebitz
    Graphs and Combinatorics, 2012, 28 : 717 - 722
  • [22] Note on the game chromatic index of trees
    Erdös, PL
    Faigle, U
    Hochstättler, W
    Kern, W
    THEORETICAL COMPUTER SCIENCE, 2004, 313 (03) : 371 - 376
  • [23] A Note on the Game Chromatic Index of Graphs
    Tomasz Bartnicki
    Jarosław Grytczuk
    Graphs and Combinatorics, 2008, 24 : 67 - 70
  • [24] Bounds for the chromatic index of signed multigraphs
    Steffen, Eckhard
    Wolf, Isaak H.
    DISCRETE APPLIED MATHEMATICS, 2023, 337 : 185 - 189
  • [25] The mod k chromatic index of random graphs
    Botler, Fabio
    Colucci, Lucas
    Kohayakawa, Yoshiharu
    JOURNAL OF GRAPH THEORY, 2023, 103 (04) : 767 - 779
  • [26] A note on the (g,f)-chromatic index of graphs
    Xu, Changqing
    Du, Yatao
    ARS COMBINATORIA, 2008, 86 : 389 - 393
  • [27] On the fractional chromatic index of a graph and its complement
    Avis, D
    De Simone, C
    Reed, B
    OPERATIONS RESEARCH LETTERS, 2005, 33 (04) : 385 - 388
  • [28] Improved bounds for the chromatic index of graphs and multigraphs
    Hakimi, SL
    Schmeichel, EF
    JOURNAL OF GRAPH THEORY, 1999, 32 (04) : 311 - 326
  • [29] Upper bounds on the uniquely restricted chromatic index
    Baste, Julien
    Rautenbach, Dieter
    Sau, Ignasi
    JOURNAL OF GRAPH THEORY, 2019, 91 (03) : 251 - 258
  • [30] A Combined Logarithmic Bound on the Chromatic Index of Multigraphs
    Plantholt, Michael
    JOURNAL OF GRAPH THEORY, 2013, 73 (03) : 239 - 259
12345