Petr Vrána

Orcid: 0000-0001-9246-474X

According to our database1, Petr Vrána authored at least 38 papers between 2007 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Hamilton-connected {claw,net}-free graphs, II.
J. Graph Theory, May, 2023

Hamilton-connected {claw, bull}-free graphs.
J. Graph Theory, 2023

Hamilton-connected {claw, net}-free graphs, I.
J. Graph Theory, 2023

Quasigraphs and skeletal partitions.
Eur. J. Comb., 2023

2022
Forbidden pairs of disconnected graphs for 2-factor of connected graphs.
J. Graph Theory, 2022

Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected.
Discret. Math., 2022

Hamilton cycles in line graphs of 3-hypergraphs.
Discret. Math., 2022

Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4.
Discret. Math., 2022

Forbidden Induced Pairs for Perfectness and $\omega$-Colourability of Graphs.
Electron. J. Comb., 2022

2021
The Hamiltonicity of essentially 9-connected line graphs.
J. Graph Theory, 2021

Every 3-connected {K1, 3, Z7}-free graph of order at least 21 is Hamilton-connected.
Discret. Math., 2021

2020
A Note on Singular Edges and Hamiltonicity in Claw-Free Graphs with Locally Disconnected Vertices.
Graphs Comb., 2020

Thomassen's conjecture for line graphs of 3-hypergraphs.
Discret. Math., 2020

2019
Closure for {<i>K</i><sub>1, 4</sub>, <i>K</i><sub>1, 4</sub> + <i>e</i>}-free graphs.
J. Comb. Theory, Ser. B, 2019

On forbidden induced subgraphs for K1, 3-free perfect graphs.
Discret. Math., 2019

2018
Hamiltonian properties of 3-connected {claw, hourglass}-free graphs.
Discret. Math., 2018

2017
Forbidden Pairs of Disconnected Graphs Implying Hamiltonicity.
J. Graph Theory, 2017

2016
Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2.
Discret. Math., 2016

Finite families of forbidden subgraphs for rainbow connection in graphs.
Discret. Math., 2016

2015
A Relationship Between Thomassen's Conjecture and Bondy's Conjecture.
SIAM J. Discret. Math., 2015

Equivalence of Jackson's and Thomassen's conjectures.
J. Comb. Theory, Ser. B, 2015

4-colorability of P<sub>6</sub>-free graphs.
Electron. Notes Discret. Math., 2015

Rainbow connection and forbidden subgraphs.
Discret. Math., 2015

2014
A Closure for 1-Hamilton-Connectedness in Claw-Free Graphs.
J. Graph Theory, 2014

2-edge-Hamiltonian-connectedness of 4-connected plane graphs.
Eur. J. Comb., 2014

On 1-Hamilton-connected claw-free graphs.
Discret. Math., 2014

2013
4, 5 Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski.
SIAM J. Discret. Math., 2013

Stability of Hereditary Graph Classes Under Closure Operations.
J. Graph Theory, 2013

On Forbidden Pairs Implying Hamilton-Connectedness.
J. Graph Theory, 2013

2012
Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs.
J. Graph Theory, 2012

How Many Conjectures Can You Stand? A Survey.
Graphs Comb., 2012

Hamilton cycles in 5-connected line graphs.
Eur. J. Comb., 2012

Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs.
Discret. Math., 2012

2011
Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs.
J. Graph Theory, 2011

On stability of Hamilton-connectedness under the 2-closure in claw-free graphs.
J. Graph Theory, 2011

2010
On cycle lengths in claw-free graphs with complete closure.
Discret. Math., 2010

2009
Hamilton cycles in 6-connected claw-free graphs (Extended abstract).
Electron. Notes Discret. Math., 2009

2007
Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks.
Electron. Notes Discret. Math., 2007


  Loading...