The following pages link to Properly colored paths and cycles (Q642961):
Displaying 32 items.
- Proper connection of graphs (Q442366) (← links)
- Odd properly colored cycles in edge-colored graphs (Q507513) (← links)
- Chinese postman problem on edge-colored multigraphs (Q516812) (← links)
- Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs (Q777393) (← links)
- Some algorithmic results for finding compatible spanning circuits in edge-colored graphs (Q830935) (← links)
- Exact approaches for the orderly colored longest path problem: performance comparison (Q1628069) (← links)
- Properly coloured Hamiltonian cycles in edge-coloured complete graphs (Q1677578) (← links)
- Properly edge-colored theta graphs in edge-colored complete graphs (Q1733876) (← links)
- Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result (Q1981705) (← links)
- Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs (Q2057600) (← links)
- Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs (Q2092426) (← links)
- Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs (Q2112656) (← links)
- \(H\)-cycles in \(H\)-colored multigraphs (Q2117527) (← links)
- Note on rainbow triangles in edge-colored graphs (Q2117536) (← links)
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three (Q2124635) (← links)
- Maximum properly colored trees in edge-colored graphs (Q2168717) (← links)
- Compatible spanning circuits in edge-colored graphs (Q2182217) (← links)
- A classification of edge-colored graphs based on properly colored walks (Q2192112) (← links)
- Properly colored spanning trees in edge-colored graphs (Q2279275) (← links)
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles (Q2312662) (← links)
- Acyclicity in edge-colored graphs (Q2374151) (← links)
- Cycle extension in edge-colored complete graphs (Q2400555) (← links)
- Long properly colored cycles in edge colored complete graphs (Q2440943) (← links)
- Alternating-pancyclism in 2-edge-colored graphs (Q2656333) (← links)
- Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles (Q2656965) (← links)
- Note on rainbow cycles in edge-colored graphs (Q2675843) (← links)
- Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\) (Q2698135) (← links)
- Acyclic Digraphs (Q3120435) (← links)
- A Dirac Type Condition for Properly Coloured Paths and Cycles (Q5418769) (← links)
- Minimum <scp>color‐degree</scp> perfect <i>b</i>‐matchings (Q6087129) (← links)
- Proper cycles and rainbow cycles in 2-triangle-free edge-colored complete graphs (Q6143690) (← links)
- Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs (Q6145817) (← links)
