The following pages link to Gyula Y. Katona (Q226812):
Displaying 46 items.
- Extension of paths and cycles for hypergraphs (Q277496) (← links)
- Bounds on the number of edges in hypertrees (Q279202) (← links)
- The optimal rubbling number of ladders, prisms and Möbius-ladders (Q298981) (← links)
- SIS epidemic propagation on hypergraphs (Q301557) (← links)
- Centrosymmetric graphs and a lower bound for graph energy of fullerenes (Q472133) (← links)
- Extremal \(P_4\)-stable graphs (Q643018) (← links)
- Hypergraph extensions of the Erdős-Gallai theorem (Q739066) (← links)
- (Q878633) (redirect page) (← links)
- Structure theorem and algorithm on \((1,f)\)-odd subgraph (Q878634) (← links)
- Hamilton-chain saturated hypergraphs (Q966015) (← links)
- Elementary graphs with respect to \(f\)-parity factors (Q968209) (← links)
- Searching for \(f\)-Hamiltonian circuits (Q1196437) (← links)
- Toughness and edge-toughness (Q1356703) (← links)
- Edge disjoint Polyp Packing (Q1377661) (← links)
- Odd subgraphs and matchings (Q1613457) (← links)
- Optimal pebbling number of graphs with given minimum degree (Q1741506) (← links)
- Decomposition of a graph into two disjoint odd subgraphs (Q1756121) (← links)
- Properties of edge-tough graphs (Q1808717) (← links)
- Packing paths of length at least two (Q1827782) (← links)
- Chordality and 2-factors in tough graphs (Q1962052) (← links)
- Optimal pebbling and rubbling of graphs with given diameter (Q2026352) (← links)
- Optimal pebbling number of the square grid (Q2175808) (← links)
- Bounds on the rubbling and optimal rubbling numbers of graphs (Q2376084) (← links)
- Local topological toughness and local factors (Q2385135) (← links)
- Properties of minimally \(t\)-tough graphs (Q2411622) (← links)
- The optimal pebbling number of staircase graphs (Q2421883) (← links)
- Extremal \(k\)-edge-Hamiltonian hypergraphs (Q2476283) (← links)
- Hamiltonian path saturated graphs with small size (Q2492212) (← links)
- Extremal \(k\)-edge-Hamiltonian hypergraphs (Q2816088) (← links)
- Bounds on the rubbling and optimal rubbling numbers of graphs (Q2857393) (← links)
- Hypergraph extensions of the Erdős-Gallai theorem (Q2883632) (← links)
- Most probably intersecting families of subsets (Q2883864) (← links)
- A Lower Bound for Graph Energy of Fullerenes (Q2980033) (← links)
- Extremal k-edge-hamiltonian Hypergraphs (Q3438961) (← links)
- Hamiltonian Chains in Hypergraphs (Q3439478) (← links)
- (Q3576716) (← links)
- Hamiltonian chains in hypergraphs (Q4237729) (← links)
- (Q4415391) (← links)
- (Q5708533) (← links)
- A large set of non-Hamiltonian graphs (Q5954242) (← links)
- Constructions for the optimal pebbling of grids (Q6269123) (← links)
- Minimally tough chordal graphs with toughness at most $1/2$ (Q6409454) (← links)
- Towards a Baranyai theorem with additional condition (Q6463612) (← links)
- Minimal toughness in special graph classes (Q6507454) (← links)
- Minimal toughness in special graph classes (Q6599813) (← links)
- An efficient algorithm to compute the toughness in graphs with bounded treewidth (Q6616440) (← links)
