Preuniquely k-colourable graphs and k-colouring matrices

被引：0
|
作者：
机构：
来源：
| 1991年 / 27期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [21] On the sum of k largest eigenvalues of graphs and symmetric matrices
    Mohar, Bojan
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2009, 99 (02) : 306 - 313
  • [22] Lower bounds for the game colouring number of partial k-trees and planar graphs
    Wu, Jiaojiao
    Zhu, Xuding
    DISCRETE MATHEMATICS, 2008, 308 (12) : 2637 - 2642
  • [23] The k-generalized Hermitian adjacency matrices for mixed graphs
    Yu, Yuantian
    Geng, Xianya
    Zhou, Zihan
    DISCRETE MATHEMATICS, 2023, 346 (02)
  • [24] The inertia and energy of distance matrices of complete k-partite graphs
    Zhang, Xiaoling
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2014, 450 : 108 - 120
  • [25] CRITICALLY (K,K)-CONNECTED GRAPHS
    ANDO, K
    USAMI, Y
    DISCRETE MATHEMATICS, 1987, 66 (1-2) : 15 - 20
  • [26] CODES FROM THE INCIDENCE MATRICES AND LINE GRAPHS OF HAMMING GRAPHS Hk(n, 2) FOR k ≥ 2
    Key, Jennifer D.
    Fish, Washiela
    Mwambene, Eric
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2011, 5 (02) : 373 - 394
  • [27] PERFECT K-LINE GRAPHS AND K-TOTAL GRAPHS
    LE, VB
    JOURNAL OF GRAPH THEORY, 1993, 17 (01) : 65 - 73
  • [28] The symmetric (2k, k)-graphs
    Kriesell, M
    JOURNAL OF GRAPH THEORY, 2001, 36 (01) : 35 - 51
  • [29] On (Kq, k) stable graphs with small k
    Fouquet, Jean-Luc
    Thuillier, Henri
    Vanherpe, Jean-Marie
    Wojda, Adam Pawel
    ELECTRONIC JOURNAL OF COMBINATORICS, 2012, 19 (02):
  • [30] Binary codes and partial permutation decoding sets from biadjacency matrices of bipartite graphs Γ(2k, k, k+1, 1)
    Fish, W.
    Mumba, N. B.
    Mwambene, E.
    Rodrigues, B. G.
    QUAESTIONES MATHEMATICAE, 2020, 43 (04) : 523 - 538
12345