Finite dualities and map-critical graphs on a fixed surface

Authors:
Jaroslav Nešetřil;Yared Nigussie
Affiliations:
Department of Applied Mathematics, Institute for Theoretical Computer Science (ITI), Charles University, Czech Republic;Department of Mathematics, East Tennessee State University, United States
Venue:
Journal of Combinatorial Theory Series B
Year:
2012

On the complexity of H-coloring

Journal of Combinatorial Theory Series B
Five-coloring graphs on the torus

Journal of Combinatorial Theory Series B
Color-critical graphs on a fixed surface

Journal of Combinatorial Theory Series B - Special issue: dedicated to Professor W. T. Tutte on the occasion of his eightieth birthday
Graph Minors. XX. Wagner's conjecture

Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Universal partial order represented by means of oriented trees and other simple graphs

European Journal of Combinatorics
Folding

Journal of Combinatorial Theory Series B
Minimal universal and dense minor closed classes

European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
Grad and classes with bounded expansion III. Restricted graph homomorphism dualities

European Journal of Combinatorics
Hadwiger's conjecture is decidable

Proceedings of the forty-first annual ACM symposium on Theory of computing
A New Proof of the $H$-Coloring Dichotomy

SIAM Journal on Discrete Mathematics

Hi-index	0.00

Let K be a class of graphs. A pair (F,U) is a finite duality in K if U@?K, F is a finite set of graphs, and for any graph G in K we have G=