Pages that link to "Item:Q3655153"
From MaRDI portal
The following pages link to Properly Coloured Cycles and Paths: Results and Open Problems (Q3655153):
Displaying 11 items.
- On the maximum disjoint paths problem on edge-colored graphs (Q435732) (← links)
- Odd properly colored cycles in edge-colored graphs (Q507513) (← links)
- Separating codes and traffic monitoring (Q1704860) (← links)
- Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result (Q1981705) (← links)
- Paths and trails in edge-colored weighted graphs (Q2333812) (← links)
- Proper Hamiltonian paths in edge-coloured multigraphs (Q2409503) (← links)
- Long properly colored cycles in edge colored complete graphs (Q2440943) (← links)
- The complexity of routing problems in forbidden-transition graphs and edge-colored graphs (Q2701383) (← links)
- Proper‐walk connection number of graphs (Q6055386) (← links)
- (Q6065468) (← links)
- Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs (Q6145817) (← links)
