The following pages link to (Q3137222):
Displaying 13 items.
- New examples of graphs without small cycles and of large size (Q1322411) (← links)
- Embedding graphs of small size (Q1329826) (← links)
- Embedding digraphs of small size (Q1356787) (← links)
- Packing of graphs and permutations -- a survey (Q1422441) (← links)
- A note on the ``packing of two copies of some trees into their third power'' (Q1431988) (← links)
- Sparse graphs of girth at least five are packable (Q1759402) (← links)
- A note on graphs without short even cycles (Q1773215) (← links)
- A note on embedding graphs without short cycles (Q1883254) (← links)
- Packing three trees (Q1916129) (← links)
- A note on packing graphs without cycles of length up to five (Q2380220) (← links)
- Some problems in graph theory (Q4050640) (← links)
- (Q4269446) (← links)
- Labeled packing of non star trees into their \(k\) th power, \(k\geq 5\) (Q6562431) (← links)
