Clik here to view.
Clik here to view.
Computational Complexity of the Krausz Dimension of Graphs.
Petr Hlinený, Jan Kratochvíl: Computational Complexity of the Krausz Dimension of Graphs. WG 1997: 214-228
View ArticleClik here to view.
Touching Graphs of Unit Balls.
Petr Hlinený: Touching Graphs of Unit Balls. GD 1997: 350-358
View ArticleClik here to view.
Classes and Recognition of Curve Contact Graphs, .
Petr Hlinený: Classes and Recognition of Curve Contact Graphs, . J. Comb. Theory, Ser. B 74(1): 87-103 (1998)
View ArticleClik here to view.
The Maximal Clique and Colourability of Curve Contact Graphs.
Petr Hlinený: The Maximal Clique and Colourability of Curve Contact Graphs. Discret. Appl. Math. 81(1-3): 59-68 (1998)
View ArticleClik here to view.
A note on possible extensions of Negami's conjecture.
Petr Hlinený: A note on possible extensions of Negami's conjecture. J. Graph Theory 32(3): 234-240 (1999)
View ArticleClik here to view.
Crossing-Critical Graphs and Path-Width.
Petr Hlinený: Crossing-Critical Graphs and Path-Width. GD 2001: 102-114
View ArticleClik here to view.
Another two graphs with no planar covers.
Petr Hlinený: Another two graphs with no planar covers. J. Graph Theory 37(4): 227-242 (2001)
View ArticleClik here to view.
Contact graphs of line segments are NP-complete.
Petr Hlinený: Contact graphs of line segments are NP-complete. Discret. Math. 235(1-3): 95-106 (2001)
View ArticleClik here to view.
Representing graphs by disks and balls (a survey of recognition-complexity...
Petr Hlinený, Jan Kratochvíl: Representing graphs by disks and balls (a survey of recognition-complexity results). Discret. Math. 229(1-3): 101-124 (2001)
View ArticleClik here to view.
An Addition to Art Galleries with Interior Walls.
Petr Hlinený: An Addition to Art Galleries with Interior Walls. Discret. Comput. Geom. 25(2): 311-334 (2001)
View ArticleClik here to view.
On the Excluded Minors for Matroids of Branch-Width Three.
Petr Hlinený: On the Excluded Minors for Matroids of Branch-Width Three. Electron. J. Comb. 9(1) (2002)
View ArticleClik here to view.
Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids.
Petr Hlinený: Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids. STACS 2003: 319-330
View ArticleClik here to view.
On Matroid Properties Definable in the MSO Logic.
Petr Hlinený: On Matroid Properties Definable in the MSO Logic. MFCS 2003: 470-479
View ArticleClik here to view.
Crossing-number critical graphs have bounded path-width.
Petr Hlinený: Crossing-number critical graphs have bounded path-width. J. Comb. Theory, Ser. B 88(2): 347-367 (2003)
View ArticleClik here to view.
Crossing Number Is Hard for Cubic Graphs.
Petr Hlinený: Crossing Number Is Hard for Cubic Graphs. MFCS 2004: 772-782
View ArticleClik here to view.
On Decidability of MSO Theories of Representable Matroids.
Petr Hlinený, Detlef Seese: On Decidability of MSO Theories of Representable Matroids. IWPEC 2004: 96-107
View ArticleClik here to view.
Bridging Separations in Matroids.
James F. Geelen, Petr Hlinený, Geoffrey P. Whittle: Bridging Separations in Matroids. SIAM J. Discret. Math. 18(3): 638-646 (2004)
View ArticleClik here to view.
On possible counterexamples to Negami's planar cover conjecture.
Petr Hlinený, Robin Thomas: On possible counterexamples to Negami's planar cover conjecture. J. Graph Theory 46(3): 183-206 (2004)
View ArticleClik here to view.
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width.
Omer Giménez, Petr Hlinený, Marc Noy: Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. WG 2005: 59-68
View Article
