Pages that link to "Item:Q2279275"
From MaRDI portal
The following pages link to Properly colored spanning trees in edge-colored graphs (Q2279275):
Displaying 9 items.
- Sufficient conditions for the existence of spanning colored trees in edge-colored graphs (Q442397) (← links)
- Building graphs from colored trees (Q612947) (← links)
- Rainbow and properly colored spanning trees in edge-colored bipartite graphs (Q2051897) (← links)
- Maximum properly colored trees in edge-colored graphs (Q2168717) (← links)
- Color degree sum conditions for properly colored spanning trees in edge-colored graphs (Q2198384) (← links)
- Maximum colored trees in edge-colored graphs (Q2311375) (← links)
- A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph (Q2502039) (← links)
- Generation of colour-constrained spanning trees with application in symbolic circuit analysis (Q4355497) (← links)
- Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$ (Q5014139) (← links)