Preuniquely k-colourable graphs and k-colouring matrices

被引：0
|
作者：
机构：
来源：
| 1991年 / 27期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [31] (Δ-k)-critical graphs
    Farzad, B
    Molloy, M
    Reed, B
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2005, 93 (02) : 173 - 185
  • [32] ON (D,K) GRAPHS
    KORN, I
    IEEE TRANSACTIONS ON ELECTRONIC COMPUTERS, 1967, EC16 (01): : 90 - &
  • [33] EMBEDDING K-REGULAR GRAPHS IN K+1-REGULAR GRAPHS
    GARDINER, A
    JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1983, 28 (DEC): : 393 - 400
  • [34] Book embeddings of k-framed graphs and k-map graphs
    Bekos, Michael A.
    Da Lozzo, Giordano
    Griesbach, Svenja M.
    Gronemann, Martin
    Montecchiani, Fabrizio
    Raftopoulou, Chrysanthi
    DISCRETE MATHEMATICS, 2024, 347 (01)
  • [35] Pagenumber of pathwidth-k graphs and strong pathwidth-k graphs
    Togasaki, M
    Yamazaki, K
    DISCRETE MATHEMATICS, 2002, 259 (1-3) : 361 - 368
  • [36] On the complexity of k-rainbow cycle colouring problems
    Li, Shasha
    Shi, Yongtang
    Tu, Jianhua
    Zhao, Yan
    DISCRETE APPLIED MATHEMATICS, 2019, 264 : 125 - 133
  • [37] Binary Codes and Partial Permutation Decoding Sets from Biadjacency Matrices of the Bipartite Graphs Γ (2k+1, k, k+2, 1)
    Fish, W.
    Mumba, N. B.
    Mwambene, E.
    Rodrigues, B. G.
    GRAPHS AND COMBINATORICS, 2017, 33 (02) : 357 - 368
  • [38] K K,K IS (K-1, 1)-CRITICAL FOR K-REGULAR K-CONNECTED GRAPHS
    ALDRED, REL
    JIA, RZ
    ARS COMBINATORIA, 1988, 26B : 247 - 248
  • [39] Connected [k,k+1]-factors of graphs
    Cai, MC
    DISCRETE MATHEMATICS, 1997, 169 (1-3) : 1 - 16
  • [40] k-Shredders in k-Connected Graphs
    Egawa, Yoshimi
    JOURNAL OF GRAPH THEORY, 2008, 59 (03) : 239 - 259
12345