The following pages link to Roman Čada (Q327289):
Displaying 36 items.
- Induced subgraphs with large degrees at end-vertices for Hamiltonicity of claw-free graphs (Q327292) (← links)
- Circumferences of 2-factors in claw-free graphs (Q383757) (← links)
- 2-factors in claw-free graphs with lower bounds cycle lengths (Q489345) (← links)
- A note on degree conditions for traceability in locally claw-free graphs (Q691626) (← links)
- (Q705707) (redirect page) (← links)
- Two tree-width-like graph invariants (Q705708) (← links)
- Rainbow cycles in edge-colored graphs (Q906488) (← links)
- Disjoint Hamilton cycles in the star graph (Q990094) (← links)
- The \(*\)-closure for graphs and claw-free graphs (Q998440) (← links)
- Degree conditions on induced claws (Q998442) (← links)
- Hamiltonicity and pancyclicity of Cartesian products of graphs (Q1045164) (← links)
- Separating multi-oddity constrained shortest circuits over the polytope of stable multisets. (Q1417599) (← links)
- Cycles through given vertices and closures (Q1422413) (← links)
- Pairs of forbidden subgraphs and 2-connected supereulerian graphs (Q1744755) (← links)
- Hamiltonian decompositions of prisms over cubic graphs (Q1883249) (← links)
- Lovász extension and graph cut (Q2057034) (← links)
- Equivalence of Jackson's and Thomassen's conjectures (Q2349510) (← links)
- Radio labelings of distance graphs (Q2446877) (← links)
- Short disjoint paths in locally connected graphs (Q2464055) (← links)
- On the extreme eigenvalues of regular graphs. (Q2490837) (← links)
- On the hull number of a graph. (Q2715978) (← links)
- New families of graceful disconnected graphs. (Q2715990) (← links)
- Multiplicity of triangles in \(2\)-edge coloring of a family of graphs. (Q2715992) (← links)
- Two families of graphs that are not CCE-orientable. (Q2715996) (← links)
- Linear vertex arboricity, independence number and clique cover number. (Q2716006) (← links)
- Small 2-factors of bipartite graphs. (Q2716007) (← links)
- A new-old algorithm for minimum-cut and maximum-flow in closure graphs. (Q2744651) (← links)
- 2-factors in claw-free graphs (Q2857347) (← links)
- Hamiltonicity and pancyclicity of generalized prisms (Q3439413) (← links)
- Path factors and line graphs (Q3439616) (← links)
- A Relationship Between Thomassen's Conjecture and Bondy's Conjecture (Q3453562) (← links)
- A complete bipartite graph without properly colored cycles of length four (Q5110650) (← links)
- ${4,5}$ Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski (Q5300486) (← links)
- On Dominating Even Subgraphs in Cubic Graphs (Q5346564) (← links)
- A parallel grasp for the Steiner tree problem in graphs using a hybrid local search strategy (Q5928213) (← links)
- A probabilistic analysis of the multi-period single-sourcing problem (Q5946827) (← links)
