The following pages link to (Q4836076):
Displayed 22 items.
- Properly colored paths and cycles (Q642961) (← links)
- Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs (Q777393) (← links)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813) (← links)
- Color degree and alternating cycles in edge-colored graphs (Q1043956) (← links)
- Alternating cycles and paths in edge-coloured multigraphs: A survey (Q1356728) (← links)
- Properly coloured Hamiltonian paths in edge-coloured complete graphs (Q1383382) (← links)
- Alternating kernels (Q1693142) (← links)
- A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs (Q2012053) (← links)
- \(H\)-cycles in \(H\)-colored multigraphs (Q2117527) (← links)
- Two sufficient conditions for 2-connected graphs to have proper connection number 2 (Q2186294) (← links)
- Optimal proper connection of graphs (Q2192984) (← links)
- The optimal proper connection number of a graph with given independence number (Q2234746) (← links)
- Optimal pathway reconstruction on 3D NMR maps (Q2255053) (← links)
- Note on directed proper connection number of a random graph (Q2279590) (← links)
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles (Q2312662) (← links)
- Some conditions for the existence of Euler \(H\)-trails (Q2334082) (← links)
- Minimal colorings for properly colored subgraphs (Q2563425) (← links)
- Alternating-pancyclism in 2-edge-colored graphs (Q2656333) (← links)
- A generalization of properly colored paths and cycles in edge-colored graphs (Q2682924) (← links)
- On s-t paths and trails in edge-colored graphs (Q2840541) (← links)
- On the (di)graphs with (directed) proper connection number two (Q5918844) (← links)
- Color degree condition for long rainbow paths in edge-colored graphs (Q5964923) (← links)