Pages that link to "Item:Q1356728"
From MaRDI portal
The following pages link to Alternating cycles and paths in edge-coloured multigraphs: A survey (Q1356728):
Displaying 41 items.
- Proper connection of graphs (Q442366) (← links)
- Properly colored paths and cycles (Q642961) (← links)
- Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs (Q777393) (← links)
- Color degree and alternating cycles in edge-colored graphs (Q1043956) (← links)
- A note on alternating cycles in edge-coloured graphs (Q1354729) (← links)
- Properly coloured Hamiltonian paths in edge-coloured complete graphs (Q1383382) (← links)
- Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs (Q1584322) (← links)
- Note on alternating directed cycles (Q1584433) (← links)
- On the tractability of shortest path problems in weighted edge-coloured graphs (Q1621167) (← links)
- Alternating kernels (Q1693142) (← links)
- A note on equitable Hamiltonian cycles (Q1983122) (← links)
- A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs (Q2012053) (← links)
- On the number of alternating paths in bipartite complete graphs (Q2014212) (← links)
- On supereulerian 2-edge-coloured graphs (Q2053721) (← links)
- Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs (Q2092426) (← links)
- Networks, frictions, and price dispersion (Q2212770) (← links)
- On the number of alternating paths in random graphs (Q2231749) (← links)
- Symbolic coloured SCC decomposition (Q2233494) (← links)
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles (Q2312662) (← links)
- Paths and trails in edge-colored weighted graphs (Q2333812) (← links)
- Extensions of results on rainbow Hamilton cycles in uniform hypergraphs (Q2345522) (← links)
- Paths and trails in edge-colored graphs (Q2378531) (← links)
- Proper Hamiltonian cycles in edge-colored multigraphs (Q2397532) (← links)
- Proper Hamiltonian paths in edge-coloured multigraphs (Q2409503) (← links)
- Long properly colored cycles in edge colored complete graphs (Q2440943) (← links)
- Fork-forests in bi-colored complete bipartite graphs (Q2446314) (← links)
- Alternating-pancyclism in 2-edge-colored graphs (Q2656333) (← links)
- Properly colored 2-factors of edge-colored complete bipartite graphs (Q2675853) (← links)
- A generalization of properly colored paths and cycles in edge-colored graphs (Q2682924) (← links)
- Unbalanced spanning subgraphs in edge labeled complete graphs (Q2692172) (← links)
- On s-t paths and trails in edge-colored graphs (Q2840541) (← links)
- Cycles and paths in edge‐colored graphs with given degrees (Q3055905) (← links)
- Properly Coloured Cycles and Paths: Results and Open Problems (Q3655153) (← links)
- A 0.3622-Approximation Algorithm for the Maximum k-Edge-Colored Clustering Problem (Q4965094) (← links)
- (Q5061404) (← links)
- (Q5094123) (← links)
- Paths and Trails in Edge-Colored Graphs (Q5458574) (← links)
- On the (di)graphs with (directed) proper connection number two (Q5918844) (← 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)
- Parallel connectivity in edge-colored complete graphs: complexity results (Q6154375) (← links)
