The following pages link to Petr Vrána (Q297931):
Displayed 43 items.
- Finite families of forbidden subgraphs for rainbow connection in graphs (Q297932) (← links)
- 4-colorability of \(P_6\)-free graphs (Q322185) (← links)
- On 1-Hamilton-connected claw-free graphs (Q394533) (← links)
- Hamilton cycles in 5-connected line graphs (Q412285) (← links)
- Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs (Q432724) (← links)
- (Q659763) (redirect page) (← links)
- How many conjectures can you stand? A survey (Q659764) (← links)
- Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2 (Q898171) (← links)
- On cycle lengths in claw-free graphs with complete closure (Q960969) (← links)
- Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks (Q998345) (← links)
- Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs (Q1633754) (← links)
- Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs (Q1744769) (← links)
- On forbidden induced subgraphs for \(K_{1, 3}\)-free perfect graphs (Q1999727) (← links)
- Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected (Q2022131) (← links)
- Quasigraphs and skeletal partitions (Q2080216) (← links)
- Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4 (Q2124634) (← links)
- Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs (Q2138579) (← links)
- Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected (Q2142647) (← links)
- Hamilton cycles in line graphs of 3-hypergraphs (Q2144607) (← links)
- Thomassen's conjecture for line graphs of 3-hypergraphs (Q2174582) (← links)
- A note on singular edges and Hamiltonicity in claw-free graphs with locally disconnected vertices (Q2175798) (← links)
- Rainbow connection and forbidden subgraphs (Q2346333) (← links)
- Equivalence of Jackson's and Thomassen's conjectures (Q2349510) (← links)
- 2-edge-Hamiltonian-connectedness of 4-connected plane graphs (Q2509769) (← links)
- Hamilton cycles in 6-connected claw-free graphs (Extended abstract) (Q2851482) (← links)
- Stability of Hereditary Graph Classes Under Closure Operations (Q2852612) (← links)
- Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs (Q2891038) (← links)
- Forbidden Pairs of Disconnected Graphs Implying Hamiltonicity (Q2978174) (← links)
- On stability of Hamilton-connectedness under the 2-closure in claw-free graphs (Q3081310) (← links)
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs (Q3081311) (← links)
- Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks (Q3439565) (← links)
- A Relationship Between Thomassen's Conjecture and Bondy's Conjecture (Q3453562) (← links)
- On Forbidden Pairs Implying Hamilton‐Connectedness (Q4916093) (← links)
- ${4,5}$ Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski (Q5300486) (← links)
- A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs (Q5417830) (← links)
- Hamilton‐connected {claw,net}‐free graphs, II (Q6047639) (← links)
- The Hamiltonicity of essentially 9‐connected line graphs (Q6055939) (← links)
- Forbidden pairs of disconnected graphs for 2‐factor of connected graphs (Q6081558) (← links)
- Hamilton‐connected {claw, bull}‐free graphs (Q6093142) (← links)
- Hamilton‐connected {claw, net}‐free graphs, I (Q6093143) (← links)
- Equivalent formulation of Thomassen's conjecture using Tutte paths in claw-free graphs (Q6322321) (← links)
- Proof of a conjecture on hamiltonian-connected graphs (Q6381631) (← links)
- Packing $T$-connectors in graphs needs more connectivity (Q6447319) (← links)