Pages that link to "Item:Q5110650"
From MaRDI portal
The following pages link to A complete bipartite graph without properly colored cycles of length four (Q5110650):
Displayed 6 items.
- Edge-colored complete graphs containing no properly colored odd cycles (Q2045403) (← links)
- Disjoint properly colored cycles in edge-colored complete bipartite graphs (Q2092322) (← links)
- On connectivities of edge-colored graphs (Q2104926) (← links)
- Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs (Q2112656) (← links)
- A classification of edge-colored graphs based on properly colored walks (Q2192112) (← links)
- Edge‐colored complete graphs without properly colored even cycles: A full characterization (Q6056775) (← links)