Pages that link to "Item:Q916671"
From MaRDI portal
The following pages link to Covering the complete graph by partitions (Q916671):
Displaying 15 items.
- Complete partitions of graphs (Q949754) (← links)
- Weighted arcs, the finite Radon transform and a Ramsey problem (Q1175558) (← links)
- Covering \(t\)-element sets by partitions (Q1180794) (← links)
- Intersecting designs from linear programming and graphs of diameter two (Q1322228) (← links)
- Acyclic graphoidal covers and path partitions in a graph (Q1584403) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Partitions and well-coveredness: the graph sandwich problem (Q2111912) (← links)
- Restricted online Ramsey numbers of matchings and trees (Q2195227) (← links)
- Monochromatic diameter-2 components in edge colorings of the complete graph (Q2233352) (← links)
- Large components in \(r\)-edge-colorings of \(K_n\) have diameter at most five (Q2891044) (← links)
- Complete partitions of graphs (Q2921751) (← links)
- On the pseudoachromatic index of the complete graph (Q3081306) (← links)
- Large Monochromatic Triple Stars in Edge Colourings (Q3466347) (← links)
- Bounding the pseudoachromatic index of the complete graph via projective planes (Q3503537) (← links)
- Large monochromatic components of small diameter (Q6056809) (← links)