The following pages link to Pavel Nejedlý (Q967307):
Displaying 7 items.
- Distance constrained labelings of planar graphs with no short cycles (Q967308) (← links)
- Distance constrained labelings of \(K_{4}\)-minor free graphs (Q1045067) (← links)
- Coloring squares of planar graphs with girth six (Q2427536) (← links)
- Choosability of graphs with infinite sets of forbidden differences (Q2462372) (← links)
- Short Cycle Covers of Graphs with Minimum Degree Three (Q3084229) (← links)
- Distance Constrained Labelings of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-minor Free Graphs (Q3439631) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311103) (← links)
