Search results for "Bernard Lidický"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma	The k-in-a-Path Problem for Claw-free Graphs.	Algorithmica	2012	DBLP DOI BibTeX RDF
1	Zdenek Dvorak, Bernard Lidický, Riste Skrekovski	Bipartizing fullerenes.	Eur. J. Comb.	2012	DBLP DOI BibTeX RDF
1	Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma	Finding vertex-surjective graph homomorphisms	CoRR	2012	DBLP BibTeX RDF
1	Jirí Fiala, Petr A. Golovach, Jan Kratochvíl, Bernard Lidický, Daniël Paulusma	Distance three labelings of trees.	Discrete Applied Mathematics	2012	DBLP DOI BibTeX RDF
1	Jan Ekstein, Premysl Holub, Bernard Lidický	Packing chromatic number of distance graphs.	Discrete Applied Mathematics	2012	DBLP DOI BibTeX RDF
1	Zdenek Dvorak, Bernard Lidický, Riste Skrekovski	Randić index and the diameter of a graph.	Eur. J. Comb.	2011	DBLP DOI BibTeX RDF
1	Jan Ekstein, Premysl Holub, Bernard Lidický	Packing Chromatic Number of Distance Graphs	CoRR	2011	DBLP BibTeX RDF
1	Zdenek Dvorak, Bernard Lidický, Riste Skrekovski	Graphs with Two Crossings Are 5-Choosable.	SIAM J. Discrete Math.	2011	DBLP DOI BibTeX RDF
1	Rok Erman, Frédéric Havet, Bernard Lidický, Ondrej Pangrác	5-Coloring Graphs with 4 Crossings.	SIAM J. Discrete Math.	2011	DBLP DOI BibTeX RDF
1	Ondrej Bílka, Bernard Lidický, Marek Tesar	Locally Injective Homomorphism to the Simple Weight Graphs.	TAMC	2011	DBLP DOI BibTeX RDF
1	Jan Ekstein, Jirí Fiala, Premysl Holub, Bernard Lidický	The packing chromatic number of the square lattice is at least 12	CoRR	2010	DBLP BibTeX RDF
1	Tomás Kaiser, Daniel Král', Bernard Lidický, Pavel Nejedlý, Robert Sámal	Short Cycle Covers of Graphs with Minimum Degree Three.	SIAM J. Discrete Math.	2010	DBLP DOI BibTeX RDF
1	Zdenek Dvorak, Bernard Lidický, Riste Skrekovski	3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles.	SIAM J. Discrete Math.	2010	DBLP DOI BibTeX RDF
1	Petr A. Golovach, Bernard Lidický, Daniël Paulusma	L(2, 1, 1)-Labeling Is NP-Complete for Trees.	TAMC	2010	DBLP DOI BibTeX RDF
1	Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma	The k-in-a-path Problem for Claw-free Graphs.	STACS	2010	DBLP DOI BibTeX RDF
1	Bernard Lidický, Marek Tesar	Complexity of Locally Injective Homomorphism to the Theta Graphs.	IWOCA	2010	DBLP DOI BibTeX RDF
1	Zdenek Dvorak, Bernard Lidický, Riste Skrekovski	Planar graphs without 3-, 7-, and 8-cycles are 3-choosable.	Discrete Mathematics	2009	DBLP DOI BibTeX RDF
1	Jirí Fiala, Sandi Klavzar, Bernard Lidický	The packing chromatic number of infinite product graphs.	Eur. J. Comb.	2009	DBLP DOI BibTeX RDF
1	Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma	The k-in-a-path problem for claw-free graphs	CoRR	2009	DBLP BibTeX RDF
1	Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický	6-Critical Graphs on the Klein Bottle.	SIAM J. Discrete Math.	2009	DBLP DOI BibTeX RDF
1	Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesar, Tomás Vyskocil	The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree.	Graph Drawing	2009	DBLP DOI BibTeX RDF
1	Nathan Chenette, Luke Postle, Noah Streib, Robin Thomas, Carl Yerger, Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický	Six-Critical Graphs on the Klein Bottle.	Electronic Notes in Discrete Mathematics	2008	DBLP DOI BibTeX RDF
1	Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický	Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters.	Graph Drawing	2008	DBLP DOI BibTeX RDF

Publications of "Bernard Lidický" ( http://dblp.L3S.de/Authors/Bernard_Lidický )