Preuniquely k-colourable graphs and k-colouring matrices

被引：0

作者：

机构：

来源：

| 1991年 / 27期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[1] Algorithms for colouring random k-colourable graphs
Subramanian, CR
COMBINATORICS PROBABILITY & COMPUTING, 2000, 9 (01): : 45 - 77
[2] Maximum number of edges in a preuniquely k-colourable graph with resistive k-colourings
Wentzlau, M.
Journal of Information Processing and Cybernetics, 1992, 28 (06): : 371 - 383
[3] Grid drawings of k-colourable graphs
Wood, DR
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2005, 30 (01): : 25 - 28
[4] A note on perfect Lucky k-colourable graphs
Kok, Johan
Kureethara, Joseph Varghese
JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE-JMCS, 2020, 21 (03): : 192 - 197
[5] The property of k-colourable graphs is uniquely decomposable
Broere, Izak
Dorfling, Michael J.
DISCRETE MATHEMATICS, 2013, 313 (19) : 1961 - 1964
[6] Locally bounded hereditary subclasses of k-colourable graphs
Zverovich, IE
DISCRETE APPLIED MATHEMATICS, 2001, 114 (1-3) : 301 - 311
[7] On the Number of Solutions in Random Graph k-Colouring
Rassmann, Felicia
COMBINATORICS PROBABILITY & COMPUTING, 2019, 28 (01): : 130 - 158
[8] List k-colouring Pt-free graphs: A Mim-width perspective
Brettell, Nick
Horsfield, Jake
Munaro, Andrea
Paulusma, Daniel
INFORMATION PROCESSING LETTERS, 2022, 173
[9] Algorithms for k-colouring and finding maximal independent sets
Byskov, JM
PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 456 - 457
[10] ON THE ORDER OF UNIQUELY (K,M)-COLOURABLE GRAPHS
BROERE, I
FRICK, M
DISCRETE MATHEMATICS, 1990, 82 (03) : 225 - 232