Pages that link to "Item:Q2223462"
From MaRDI portal
The following pages link to Monochromatic components in edge-coloured graphs with large minimum degree (Q2223462):
Displaying 14 items.
- Large monochromatic components in 3-colored non-complete graphs (Q778694) (← links)
- Ramsey problems involving degrees in edge-colored complete graphs of vertices belonging to monochromatic subgraphs (Q1260770) (← links)
- The order of monochromatic subgraphs with a given minimum degree (Q1408537) (← links)
- Large monochromatic components in almost complete graphs and bipartite graphs (Q2034067) (← links)
- Large monochromatic components in edge colored graphs with a minimum degree condition (Q2401439) (← links)
- Forbidden properly edge-colored subgraphs that force large highly connected monochromatic subgraphs (Q2409532) (← links)
- Colourings with Bounded Monochromatic Components in Graphs of Given Circumference (Q4595652) (← links)
- Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs (Q4638635) (← links)
- A New Bound for the 2/3 Conjecture (Q4921568) (← links)
- Large monochromatic components in multicolored bipartite graphs (Q5110681) (← links)
- Large monochromatic components of small diameter (Q6056809) (← links)
- Large monochromatic components in hypergraphs with large minimum codegree (Q6144911) (← links)
- On Connected Components with Many Edges (Q6158362) (← links)
- Large monochromatic components in expansive hypergraphs (Q6632815) (← links)