Mark Siggers
Mark Siggers
Professor of Department of Mathematics, Kyungpook National University
確認したメール アドレス: knu.ac.kr - ホームページ
タイトル
引用先
引用先
A strong Mal’cev condition for locally finite varieties omitting the unary type
MH Siggers
Algebra universalis 64 (1), 15-20, 2010
852010
Characterisation of forests with trivial game domination numbers
MJ Nadjafi-Arani, M Siggers, H Soltani
Journal of Combinatorial Optimization 32 (3), 800-811, 2016
342016
An Erdős–Ko–Rado theorem for cross t-intersecting families
P Frankl, SJ Lee, M Siggers, N Tokushige
Journal of Combinatorial Theory, Series A 128, 207-249, 2014
252014
Integer and fractional packings of hypergraphs
V Rödl, M Schacht, MH Siggers, N Tokushige
Journal of Combinatorial Theory, Series B 97 (2), 245-268, 2007
212007
A combinatorial constraint satisfaction problem dichotomy classification conjecture
J Nešetřil, MH Siggers, L Zádori
European Journal of Combinatorics 31 (1), 280-296, 2010
162010
On Ramsey minimal graphs
V Rödl, M Siggers
SIAM Journal on Discrete Mathematics 22 (2), 467-488, 2008
162008
A New Proof of the H-Coloring Dichotomy
MH Siggers
SIAM Journal on Discrete Mathematics 23 (4), 2204-2210, 2010
152010
On the complexity of H-colouring planar graphs
G MacGillivray, M Siggers
Discrete mathematics 309 (18), 5729-5738, 2009
152009
Decompositions of graphs into trees, forests, and regular subgraphs
S Akbari, TR Jensen, M Siggers
Discrete Mathematics 338 (8), 1322-1327, 2015
132015
Graphs Admitting -NU Operations. Part 1: The Reflexive Case
T Feder, P Hell, B Larose, C Loten, M Siggers, C Tardif
SIAM Journal on Discrete Mathematics 27 (4), 1940-1963, 2013
102013
On highly Ramsey infinite graphs
MH Siggers
Journal of Graph Theory 59 (2), 97-114, 2008
92008
A complexity dichotomy for signed H-colouring
RC Brewster, M Siggers
Discrete Mathematics 341 (10), 2768-2773, 2018
82018
Dichotomy for bounded degree H-colouring
MH Siggers
Discrete applied mathematics 157 (2), 201-210, 2009
82009
Combinatorial proof that subprojective constraint satisfaction problems are NP-complete
J Nešetřil, M Siggers
International Symposium on Mathematical Foundations of Computer Science, 159-170, 2007
72007
Graph homomorphism reconfiguration and frozen ‐colorings
RC Brewster, JB Lee, B Moore, JA Noel, M Siggers
Journal of Graph Theory 94 (3), 398-420, 2020
62020
Potentially H-bigraphic sequences
M Ferrara, M Jacobson, J Schmitt, M Siggers
Discussiones Mathematicae Graph Theory 29 (3), 583-596, 2009
62009
Recolouring reflexive digraphs
RC Brewster, J Lee, M Siggers
Discrete Mathematics 341 (6), 1708-1721, 2018
52018
On the representation of finite distributive lattices
M Siggers
arXiv preprint arXiv:1412.0011, 2014
52014
Color critical hypergraphs with many edges
V Rödl, M Siggers
Journal of Graph Theory 53 (1), 56-74, 2006
52006
Semilattice polymorphisms and chordal graphs
P Hell, M Siggers
European Journal of Combinatorics 36, 694-706, 2014
42014
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20