Petr Skoda

Orcid: 0000-0002-4499-7020

Affiliations:

Simon Fraser University, Department of Mathematics, Burnaby, BC, Canada

According to our database¹, Petr Skoda authored at least 9 papers between 2008 and 2024.

Collaborative distances:

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

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

Excluded minors for the Klein bottle I. Low connectivity case.

[BibT_eX]

[DOI]

Bojan Mohar

Petr Skoda

J. Comb. Theory B, January, 2024

Excluded minors for the Klein bottle II. Cascades.

[BibT_eX]

[DOI]

Bojan Mohar

Petr Skoda

J. Comb. Theory B, 2024

2017

Obstructions for two-vertex alternating embeddings of graphs in surfaces.

[BibT_eX]

[DOI]

Bojan Mohar

Petr Skoda

Eur. J. Comb., 2017

2013

Computability of width of submodular partition functions.

[BibT_eX]

[DOI]

Petr Skoda

Eur. J. Comb., 2013

2012

Domination number of cubic graphs with large girth.

[BibT_eX]

[DOI]

Daniel Král'

Petr Skoda

Jan Volec

J. Graph Theory, 2012

Minimizing the Number of Label Transitions Around a Nonseparating Vertex of a Planar Graph.

[BibT_eX]

[DOI]

Bojan Mohar

Petr Skoda

J. Graph Algorithms Appl., 2012

2011

On Minimizing the Number of Label Transitions around a Vertex of a Planar Graph.

[BibT_eX]

[DOI]

Bojan Mohar

Petr Skoda

Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

2010

An improved linear bound on the number of perfect matchings in cubic graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2010

2008

Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice.

[BibT_eX]

[DOI]

Daniel Král

Petr Skoda

SIAM J. Discret. Math., 2008

Petr Skoda

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...