Pavel Nejedlý

According to our database¹, Pavel Nejedlý authored at least 6 papers between 2004 and 2010.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2010

Short Cycle Covers of Graphs with Minimum Degree Three.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

2009

Distance constrained labelings of planar graphs with no short cycles.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

2008

Coloring squares of planar graphs with girth six.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

2007

Distance Constrained Labelings of K<sub>4</sub>-minor Free Graphs.

[BibT_eX]

[DOI]

Daniel Král

Pavel Nejedlý

Electron. Notes Discret. Math., 2007

Choosability of graphs with infinite sets of forbidden differences.

[BibT_eX]

[DOI]

Pavel Nejedlý

Discret. Math., 2007

2004

Group Coloring and List Group Coloring Are Pi<sub>2</sub>P-Complete (Extended Abstract).

[BibT_eX]

[DOI]

Daniel Král

Pavel Nejedlý

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Pavel Nejedlý

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...