Daniel Král

Samuel Mohr

Eur. J. Comb., 2026

Convergence of spectra of digraph limits.

[BibT_eX]

[DOI]

Eur. J. Comb., 2026

Hypergraphs with uniform Turán density equal to 8/27.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2026

2025

The Dimension of the Region of Feasible Tournament Profiles.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2025

Preface.

[BibT_eX]

[DOI]

Eur. J. Comb., 2025

Planar graph with twin-width seven.

[BibT_eX]

[DOI]

Ander Lamaison

Eur. J. Comb., 2025

Preface.

[BibT_eX]

[DOI]

Frederik Garbe

Jaroslav Nesetril

Eur. J. Comb., 2025

2024

Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations.

[BibT_eX]

[DOI]

J. Comb. Theory B, January, 2024

Forcing generalised quasirandom graphs efficiently.

[BibT_eX]

[DOI]

Oleg Pikhurko

Comb. Probab. Comput., January, 2024

Forcing quasirandomness with 4-point permutations.

[BibT_eX]

[DOI]

Jae-Baek Lee

Jonathan A. Noel

CoRR, 2024

Branch-depth is minor closure of contraction-deletion-depth.

[BibT_eX]

[DOI]

Marcin Brianski

Kristýna Pekárková

CoRR, 2024

Twin-Width of Graphs on Surfaces.

[BibT_eX]

[DOI]

Kristýna Pekárková

Kenny Storgel

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023

Quasirandom-Forcing Orientations of Cycles.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., December, 2023

Toward characterizing locally common graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2023

Cycles of a given length in tournaments.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2023

No additional tournaments are quasirandom-forcing.

[BibT_eX]

[DOI]

Eur. J. Comb., 2023

Closure property of contraction-depth of matroids.

[BibT_eX]

[DOI]

Marcin Brianski

Ander Lamaison

CoRR, 2023

2022

Quasirandom Latin squares.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2022

Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

Packing and covering directed triangles asymptotically.

[BibT_eX]

[DOI]

Eur. J. Comb., 2022

Inducibility and universality for trees.

[BibT_eX]

[DOI]

Comb. Theory, 2022

Density Maximizers of Layered Permutations.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

Non-Bipartite K-Common Graphs.

[BibT_eX]

[DOI]

Comb., 2022

Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Integer Programming.

[BibT_eX]

[DOI]

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

Cyclic coloring of plane graphs with maximum face size 16 and 17.

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

Coloring graphs by translates in the circle.

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2021

2020

Permutations with fixed pattern densities.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

Characterization of quasirandom permutations by a pattern sum.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

Three-coloring triangle-free graphs on surfaces III. Graphs of girth five.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

Cycles of length three and four in tournaments.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2020

Matrices of Optimal Tree-Depth and Row-Invariant Parameterized Algorithm for Integer Programming.

[BibT_eX]

[DOI]

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

A bound on the inducibility of cycles.

[BibT_eX]

[DOI]

Sergey Norin

J. Comb. Theory A, 2019

The step Sidorenko property and non-norming edge-transitive graphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2019

Decomposing Graphs into Edges and Triangles.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2019

A row-invariant parameterized algorithm for integer programming.

[BibT_eX]

[DOI]

Martin Koutecký

CoRR, 2019

Analytic representations of large graphs.

[BibT_eX]

[DOI]

Proceedings of the Surveys in Combinatorics, 2019: Invited lectures from the 27th British Combinatorial Conference, Birmingham, UK, July 29, 2019

2018

Optimal-size clique transversals in chordal graphs.

[BibT_eX]

[DOI]

Jacob W. Cooper

J. Graph Theory, 2018

Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

Elusive extremal graphs.

[BibT_eX]

[DOI]

László Miklós Lovász

CoRR, 2018

Recovering Sparse Graphs.

[BibT_eX]

[DOI]

Jakub Gajarský

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Augmenting Clinical Performance in Combat Casualty Care: Telemedicine to Automation.

[BibT_eX]

[DOI]

Elizabeth Mann-Salinas

José Salinas

Loretta Schlachta-Fairchild

Proceedings of the Augmented Cognition: Users and Contexts, 2018

2017

First order limits of sparse graphs: Plane trees and path-width.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2017

Steinberg's Conjecture is false.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Extremal graph theory and finite forcibility.

[BibT_eX]

[DOI]

László Miklós Lovász

Electron. Notes Discret. Math., 2017

First order convergence of matroids.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

Densities in large permutations and parameter testing.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

Deobfuscating sparse graphs.

[BibT_eX]

[DOI]

Jakub Gajarský

CoRR, 2017

Counting flags in triangle-free digraphs.

[BibT_eX]

[DOI]

Sergey Norin

Comb., 2017

Graphic TSP in Cubic Graphs.

[BibT_eX]

[DOI]

Bojan Mohar

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

2016

Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Packing six T-joins in plane graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

First-Order Convergence and Roots.

[BibT_eX]

[DOI]

Demetres Christofides

Comb. Probab. Comput., 2016

2015

Finitely forcible graphons and permutons.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

Third case of the Cyclic Coloring Conjecture.

[BibT_eX]

[DOI]

Michael Hebdige

Electron. Notes Discret. Math., 2015

Weak regularity and finitely forcible graph limits.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

2014

Extensions of Fractional Precolorings Show Discontinuous Behavior.

[BibT_eX]

[DOI]

Jan van den Heuvel

Martin Kupec

J. Graph Theory, 2014

The fractional chromatic number of triangle-free subcubic graphs.

[BibT_eX]

[DOI]

David G. Ferguson

Eur. J. Comb., 2014

Infinite dimensional finitely forcible graphon.

[BibT_eX]

[DOI]

Roman Glebov

Tereza Klimosová

CoRR, 2014

Large permutations and parameter testing.

[BibT_eX]

[DOI]

CoRR, 2014

Hereditary properties of permutations are strongly testable.

[BibT_eX]

[DOI]

Tereza Klimosová

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013

Rank of divisors on tropical curves.

[BibT_eX]

[DOI]

Serguei Norine

J. Comb. Theory A, 2013

On the number of pentagons in triangle-free graphs.

[BibT_eX]

[DOI]

Alexander A. Razborov

J. Comb. Theory A, 2013

Monochromatic triangles in three-coloured graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2013

Testing first-order properties for subclasses of sparse graphs.

[BibT_eX]

[DOI]

J. ACM, 2013

An application of flag algebras to a problem of Erdős and Sós.

[BibT_eX]

[DOI]

Roman Glebov

Electron. Notes Discret. Math., 2013

On the removal lemma for linear systems over Abelian groups.

[BibT_eX]

[DOI]

Oriol Serra

Lluís Vena

Eur. J. Comb., 2013

A New Bound for the 2/3 Conjecture.

[BibT_eX]

[DOI]

Chun-Hung Liu

Peter Whalen

Zelealem B. Yilma

Comb. Probab. Comput., 2013

Packing directed cycles through a specified vertex set.

[BibT_eX]

[DOI]

Marek Krcál

Stephan Kreutzer

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

FO Model Checking of Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Min-Max Relations for Odd Cycles in Planar Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

Extending Fractional Precolorings.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2012

Domination number of cubic graphs with large girth.

[BibT_eX]

[DOI]

Petr Skoda

J. Graph Theory, 2012

Coloring Eulerian Triangulations of the Klein Bottle.

[BibT_eX]

[DOI]

Graphs Comb., 2012

A superlinear bound on the number of perfect matchings in cubic bridgeless graphs.

[BibT_eX]

[DOI]

Louis Esperet

Eur. J. Comb., 2012

Classes of graphs with small rank decompositions are X-bounded.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

Cyclic colorings of plane graphs with independent faces.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

A New Lower Bound Based on Gromov's Method of Selecting Heavily Covered Points.

[BibT_eX]

[DOI]

Lukás Mach

Discret. Comput. Geom., 2012

Non-Three-Colourable Common Graphs Exist.

[BibT_eX]

[DOI]

Alexander A. Razborov

Comb. Probab. Comput., 2012

Deciding First Order Properties of Matroids.

[BibT_eX]

[DOI]

Tomas Gavenciak

Sang-il Oum

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Fractional colorings of cubic graphs with large girth.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

Limit Behavior of Locally Consistent Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Manuel Bodirsky

SIAM J. Discret. Math., 2011

Triangles in arrangements of points and lines in the plane.

[BibT_eX]

[DOI]

Pavel Klavík

Lukás Mach

J. Comb. Theory A, 2011

Fractional total colourings of graphs of high girth.

[BibT_eX]

[DOI]

Andrew D. King

J. Comb. Theory B, 2011

Deciding first order logic properties of matroids

[BibT_eX]

[DOI]

Tomas Gavenciak

Sang-il Oum

CoRR, 2011

2010

The Last Fraction of a Fractional Conjecture.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Short Cycle Covers of Graphs with Minimum Degree Three.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Coloring plane graphs with independent crossings.

[BibT_eX]

[DOI]

J. Graph Theory, 2010

Non-rainbow colorings of 3-, 4- and 5-connected plane graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2010

Markov bases of binary graph models of K4-minor free graphs.

[BibT_eX]

[DOI]

Serguei Norine

J. Comb. Theory A, 2010

Graphs with bounded tree-width and large odd-girth are almost bipartite.

[BibT_eX]

[DOI]

Alexandr V. Kostochka

Michael Stiebitz

J. Comb. Theory B, 2010

Facial colorings using Hall's Theorem.

[BibT_eX]

[DOI]

Frédéric Havet

Eur. J. Comb., 2010

An improved linear bound on the number of perfect matchings in cubic graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2010

A note on antisymmetric flows in graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2010

Brooks' Theorem via the Alon-Tarsi Theorem.

[BibT_eX]

[DOI]

Uwe Schauz

Discret. Math., 2010

Toughness threshold for the existence of 2-walks in K4-minor-free graphs.

[BibT_eX]

[DOI]

Jakub Teska

Discret. Math., 2010

Pattern Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

Decomposition Width of Matroids.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Deciding First-Order Properties for Sparse Graphs.

[BibT_eX]

[DOI]

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2009

A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs.

[BibT_eX]

[DOI]

Michael Stiebitz

SIAM J. Discret. Math., 2009

6-Critical Graphs on the Klein Bottle.

[BibT_eX]

[DOI]

Jan Kyncl

Bernard Lidický

SIAM J. Discret. Math., 2009

Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

Matchings and Nonrainbow Colorings.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

Polynomial-Size Binary Decision Diagrams for the Exactly Half-d-Hyperclique Problem Reading Each Input Bit Twice.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2009

A combinatorial proof of the Removal Lemma for Groups.

[BibT_eX]

[DOI]

Oriol Serra

Lluís Vena

J. Comb. Theory A, 2009

Circular edge-colorings of cubic graphs with girth six.

[BibT_eX]

[DOI]

Edita Mácajová

Ján Mazák

Electron. Notes Discret. Math., 2009

Cubic bridgeless graphs have more than a linear number of perfect matchings.

[BibT_eX]

[DOI]

Louis Esperet

Electron. Notes Discret. Math., 2009

Projective, affine, and abelian colorings of cubic graphs.

[BibT_eX]

[DOI]

Martin Skoviera

Eur. J. Comb., 2009

Graph labellings with variable weights, a survey.

[BibT_eX]

[DOI]

Jerrold R. Griggs

Discret. Appl. Math., 2009

Distance constrained labelings of planar graphs with no short cycles.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Decomposition width - a new width parameter for matroids

[BibT_eX]

[DOI]

CoRR, 2009

Chromatic Number for a Generalization of Cartesian Product Graphs.

[BibT_eX]

[DOI]

Douglas B. West

Electron. J. Comb., 2009

A Note on Edge-Colourings Avoiding Rainbow K4 and Monochromatic Km.

[BibT_eX]

[DOI]

Veselin Jungic

Electron. J. Comb., 2009

Algorithms for Classes of Graphs with Bounded Expansion.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Coloring triangle-free graphs on surfaces.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008

Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice.

[BibT_eX]

[DOI]

Petr Skoda

SIAM J. Discret. Math., 2008

Coloring of Triangle-Free Graphs on the Double Torus.

[BibT_eX]

[DOI]

Matej Stehlík

SIAM J. Discret. Math., 2008

Hamiltonian threshold for strong products of graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2008

List colorings with measurable sets.

[BibT_eX]

[DOI]

Michael Stiebitz

J. Graph Theory, 2008

Six-Critical Graphs on the Klein Bottle.

[BibT_eX]

[DOI]

Jan Kyncl

Bernard Lidický

Electron. Notes Discret. Math., 2008

Coloring squares of planar graphs with girth six.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

Randomized strategies for the plurality problem.

[BibT_eX]

[DOI]

Jirí Sgall

Tomás Tichý

Discret. Appl. Math., 2008

Coloring even-faced graphs in the torus and the Klein bottle.

[BibT_eX]

[DOI]

Comb., 2008

2007

Labelings of Graphs with Fixed and Variable Edge-Weights.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

Probabilistic strategies for the partition and plurality problems.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2007

Closure for the property of having a hamiltonian prism.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

Hamilton cycles in prisms.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

Tough spiders.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

The circular chromatic index of graphs of high girth.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

Distance Constrained Labelings of K4-minor Free Graphs.

[BibT_eX]

[DOI]

Pavel Nejedlý

Electron. Notes Discret. Math., 2007

Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems.

[BibT_eX]

[DOI]

Edita Mácajová

Attila Pór

Electron. Notes Discret. Math., 2007

Characterization of affine Steiner triple systems and Hall triple systems.

[BibT_eX]

[DOI]

Edita Mácajová

Attila Pór

Electron. Notes Discret. Math., 2007

Cyclic, diagonal and facial colorings - a missing case.

[BibT_eX]

[DOI]

Tomás Madaras

Eur. J. Comb., 2007

Labeling planar graphs with a condition at distance two.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

Mixed hypergraphs and other coloring problems.

[BibT_eX]

[DOI]

Discret. Math., 2007

Computing Representations of Matroids of Bounded Branch-Width.

[BibT_eX]

[DOI]

Proceedings of the STACS 2007, 2007

2006

Construction of Large Graphs with No Optimal Surjective L(2, 1)-Labelings.

[BibT_eX]

[DOI]

Martin Tancer

SIAM J. Discret. Math., 2006

The Channel Assignment Problem with Variable Weights.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2006

The last excluded case of Dirac's map-color theorem for choosability.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

Extending partial 5-colorings and 6-colorings in planar graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2006

Eulerian colorings and the bipartizing matchings conjecture of Fleischner.

[BibT_eX]

[DOI]

Eur. J. Comb., 2006

List coloring of Cartesian products of graphs.

[BibT_eX]

[DOI]

Mieczyslaw Borowiecki

Stanislav Jendrol'

Jozef Miskuf

Discret. Math., 2006

The Circular Chromatic Index of Flower Snarks.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

Colorings Of Plane Graphs With No Rainbow Faces.

[BibT_eX]

[DOI]

Veselin Jungic

Comb., 2006

Free binary decision diagrams for the computation of EARn.

[BibT_eX]

[DOI]

Comput. Complex., 2006

Upper hamiltonian numbers and hamiltonian spectra of graphs.

[BibT_eX]

[DOI]

Li-Da Tong

Xuding Zhu

Australas. J Comb., 2006

2005

Group coloring is π2P-complete.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

A Brooks-Type Theorem for the Generalized List T-Coloring.

[BibT_eX]

[DOI]

Jirí Fiala

SIAM J. Discret. Math., 2005

Coloring graphs from lists with bounded size of their union.

[BibT_eX]

[DOI]

Jirí Sgall

J. Graph Theory, 2005

A note on group colorings.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

Hamilton cycles in strong products of graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

Unions of perfect matchings in cubic graphs.

[BibT_eX]

[DOI]

Serguei Norine

Electron. Notes Discret. Math., 2005

Cyclic, diagonal and facial colorings.

[BibT_eX]

[DOI]

Tomás Madaras

Eur. J. Comb., 2005

Coloring face hypergraphs on surfaces.

[BibT_eX]

[DOI]

Eur. J. Comb., 2005

An exact algorithm for the channel assignment problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Locally Consistent Constraint Satisfaction Problems with Binary Constraints.

[BibT_eX]

[DOI]

Manuel Bodirsky

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Three Optimal Algorithms for Balls of Three Colors.

[BibT_eX]

[DOI]

Proceedings of the STACS 2005, 2005

Two algorithms for general list matrix partitions.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004

It is tough to be a plumber.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Coloring Powers of Chordal Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2004

Edge-disjoint odd cycles in planar graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2004

A revival of the girth conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2004

Pancyclicity of Strong Products of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2004

Borodin's conjecture on diagonal coloring is false.

[BibT_eX]

[DOI]

Eur. J. Comb., 2004

Locally consistent constraint satisfaction problems

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2004

Mixed hypercacti.

[BibT_eX]

[DOI]

Jan Kratochvíl

Discret. Math., 2004

On maximum face-constrained coloring of plane graphs with no short face cycles.

[BibT_eX]

[DOI]

Discret. Math., 2004

Hajós' theorem for list coloring.

[BibT_eX]

[DOI]

Discret. Math., 2004

On Feasible Sets of Mixed Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2004

An Algorithm for Cyclic Edge Connectivity of Cubic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2004

Locally satisfiable formulas.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Group Coloring and List Group Coloring Are Pi2P-Complete (Extended Abstract).

[BibT_eX]

[DOI]

Pavel Nejedlý

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Locally Consistent Constraint Satisfaction Problems: (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003

Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs.

[BibT_eX]

[DOI]

Jan Kratochvíl

Theor. Comput. Sci., 2003

A Theorem about the Channel Assignment Problem.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2003

Free Binary Decision Diagrams for Computation of EARn

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2003

Minimum Degree and the Number of Chords.

[BibT_eX]

Ars Comb., 2003

A counter-example to Voloshin's hypergraph co-perfectness conjecture.

[BibT_eX]

[DOI]

Australas. J Comb., 2003

2002

Complexity of Pattern Coloring of Cycle Systems.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

Optimal Free Binary Decision Diagrams for Computation of EARn.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2001

On Planar Mixed Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2001

Complexity of Coloring Graphs without Forbidden Induced Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

Complexity Note on Mixed Hypergraphs.

[BibT_eX]

[DOI]

Jan Kratochvíl

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

On Intersection Graphs of Segments with Prescribed Slopes.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 9th International Symposium, 2001

On Complexity of Colouring Mixed Hypertrees.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

2000

Coloring Mixed Hypertrees.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and Their Generalization.

[BibT_eX]

[DOI]