The following pages link to Agnieszka Goerlich (Q276191):
Displayed 30 items.
- On Erdős-Sós conjecture for trees of large size (Q276193) (← links)
- Item:Q276191 (redirect page) (← links)
- Cordial labeling of hypertrees (Q393911) (← links)
- A lower bound on the size of \((H;1)\)-vertex stable graphs (Q456894) (← links)
- Edge-disjoint open trails in complete bipartite multigraphs (Q604666) (← links)
- On \((C_n;k)\) stable graphs (Q648395) (← links)
- A note on packing two copies of a tree into a graph with small maximum degree (Q785787) (← links)
- A note on decompositions of transitive tournaments (Q868360) (← links)
- Fixed-point-free embeddings of digraphs with small size (Q878623) (← links)
- A note on an embedding problem in transitive tournaments (Q965937) (← links)
- Item:Q276191 (redirect page) (← links)
- Constant sum partition of sets of integers and distance magic graphs (Q1692633) (← links)
- Sparse graphs of girth at least five are packable (Q1759402) (← links)
- A note on embedding graphs without short cycles (Q1883254) (← links)
- \( \mathbb{Z}_2 \times \mathbb{Z}_2\)-cordial cycle-free hypergraphs (Q2042612) (← links)
- Upper bounds on inclusive distance vertex irregularity strength (Q2053732) (← links)
- A note on packing graphs without cycles of length up to five (Q2380220) (← links)
- A note on a packing problem in transitive tournaments (Q2502029) (← links)
- Open trails in digraphs (Q3093025) (← links)
- (Q3404145) (← links)
- Decomposition of complete bipartite graphs into open trails (Q3439411) (← links)
- Arbitrarily vertex decomposable caterpillars with four or five leaves (Q3508845) (← links)
- On cyclically embeddable (n,n)-graphs (Q4458972) (← links)
- Anti-Ramsey numbers for disjoint copies of graphs (Q4690986) (← links)
- Upper bounds on distance vertex irregularity strength of some families of graphs (Q5089899) (← links)
- (Q5294913) (← links)
- On Packable Digraphs (Q5392909) (← links)
- (Q5503352) (← links)
- A note on $k$-cordial $p$-uniform hypertrees (Q6215863) (← links)
- $k$-fault-tolerant graphs for $p$ disjoint complete graphs of order $c$ (Q6420471) (← links)