prof. RNDr. Petr Hliněný, Ph.D.

2004

• Crossing Number is Hard for Cubic Graphs (extended abstract)

  HLINĚNÝ Petr

  Article in Periodical

  Lecture Notes in Computer Science, year: 2004, volume: 3153

• Matroid decompositions

  HLINĚNÝ Petr

  Year: 2004, type:

• On Decidability of MSO Theories of Representable Matroids

  HLINĚNÝ Petr SEESE Detlef

  Article in Periodical

  Lecture Notes in Computer Science, year: 2004, volume: 3162

• On possible counterexamples to Negami's planar cover conjecture

  HLINĚNÝ Petr THOMAS Robin

  Article in Periodical

  Journal of Graph Theory, year: 2004, volume: 46, edition: 3

• Using a Computer in Matroid Theory Research

  HLINĚNÝ Petr

  Article in Periodical

  Acta Math. Univ. M. Belii, year: 2004, volume: 11, edition: 1

2003

• A new proof for chordal graphs

  HLINĚNÝ Petr

  Article in Periodical

  Acta Math. Univ. M. Belii, year: 2003, volume: 10, edition: 1

• Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids (Extended Abstract)

  HLINĚNÝ Petr

  Article in Periodical

  Lecture Notes in Computer Science, year: 2003, volume: 2607

• Crossing-Number Critical Graphs have Bounded Pathwidth

  HLINĚNÝ Petr

  Article in Periodical

  Journal of Combinatorial Theory, Ser B, year: 2003, volume: 88, edition: 3

• Matroid Tree-Width

  HLINĚNÝ Petr WHITTLE Geoff

  Year: 2003, type:

• On Matroid Properties Definable in the MSO Logic

  HLINĚNÝ Petr

  Article in Periodical

  Lecture Notes in Computer Science, year: 2003, volume: 2747