Pages that link to "Item:Q1354729"

The following pages link to A note on alternating cycles in edge-coloured graphs (Q1354729):

Displaying 44 items.

• Uniquely forced perfect matching and unique 3-edge-coloring (Q323081) (← links)
• The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles (Q497683) (← links)
• Odd properly colored cycles in edge-colored graphs (Q507513) (← links)
• Edge-colored complete graphs with alternating cycles (Q788736) (← links)
• The cone of balanced subgraphs (Q1019652) (← links)
• Color degree and alternating cycles in edge-colored graphs (Q1043956) (← links)
• Alternating cycles and paths in edge-coloured multigraphs: A survey (Q1356728) (← links)
• Decomposing edge-colored graphs under color degree constraints (Q1689962) (← links)
• Properly edge-colored theta graphs in edge-colored complete graphs (Q1733876) (← links)
• Edge-colored complete graphs containing no properly colored odd cycles (Q2045403) (← links)
• Properly colored short cycles in edge-colored graphs (Q2065117) (← links)
• Rainbow edge-pancyclicity of strongly edge-colored graphs (Q2077375) (← links)
• Disjoint properly colored cycles in edge-colored complete bipartite graphs (Q2092322) (← 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)
• A classification of edge-colored graphs based on properly colored walks (Q2192112) (← links)
• Networks, frictions, and price dispersion (Q2212770) (← links)
• Optimal pathway reconstruction on 3D NMR maps (Q2255053) (← links)
• Maximum colored trees in edge-colored graphs (Q2311375) (← links)
• Paths and trails in edge-colored weighted graphs (Q2333812) (← links)
• Acyclicity in edge-colored graphs (Q2374151) (← links)
• Paths and trails in edge-colored graphs (Q2378531) (← links)
• Cycle extension in edge-colored complete graphs (Q2400555) (← links)
• Stars versus stripes Ramsey numbers (Q2408980) (← links)
• Long properly colored cycles in edge colored complete graphs (Q2440943) (← links)
• On edge-colored graphs covered by properly colored cycles (Q2573800) (← links)
• Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles (Q2656965) (← links)
• A generalization of properly colored paths and cycles in edge-colored graphs (Q2682924) (← links)
• The complexity of routing problems in forbidden-transition graphs and edge-colored graphs (Q2701383) (← links)
• On \(s\)--\(t\) paths and trails in edge-colored graphs (Q2840541) (← links)
• Acyclic Digraphs (Q3120435) (← links)
• Properly Coloured Cycles and Paths: Results and Open Problems (Q3655153) (← links)
• Unique Colorability and Clique Minors (Q5272642) (← links)
• A Dirac Type Condition for Properly Coloured Paths and Cycles (Q5418769) (← links)
• Paths and Trails in Edge-Colored Graphs (Q5458574) (← links)
• Properly colored cycles of different lengths in edge-colored complete graphs (Q6056740) (← links)
• Edge‐colored complete graphs without properly colored even cycles: A full characterization (Q6056775) (← links)
• (Q6065468) (← links)
• Edge-disjoint properly colored cycles in edge-colored complete graphs (Q6126721) (← links)
• On the existence of cycles with restrictions in the color transitions in edge-colored complete graphs (Q6564830) (← links)
• Cycles of length 3 and 4 in edge-colored complete graphs with restrictions in the color transitions (Q6602386) (← links)
• The fine-grained complexity of approximately counting proper connected colorings (extended abstract) (Q6606223) (← links)
• Dynamic cycles in edge-colored multigraphs (Q6660053) (← links)