Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs
From MaRDI portal
(Redirected from Publication:4638635)
Recommendations
- Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs
- Properly colored short cycles in edge-colored graphs
- Color degree and heterochromatic cycles in edge-colored graphs
- Color degree and alternating cycles in edge-colored graphs
- Color-critical graphs and hypergraphs with few edges and no short cycles
- Some remarks on long monochromatic cycles in edge-colored complete graphs
- Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree
- Monochromatic components in edge-coloured graphs with large minimum degree
- scientific article; zbMATH DE number 6470879
- Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result
Cited in
(32)- Properly edge-colored theta graphs in edge-colored complete graphs
- Vertex-disjoint rainbow triangles in edge-colored graphs
- Rainbow triangles in arc-colored tournaments
- Edge-colored complete graphs containing no properly colored odd cycles
- Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs
- Properly colored short cycles in edge-colored graphs
- Rainbow edge-pancyclicity of strongly edge-colored graphs
- Disjoint properly colored cycles in edge-colored complete bipartite graphs
- Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs
- Disproof of a conjecture on the rainbow triangles in arc-colored digraphs
- Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs
- Note on rainbow triangles in edge-colored graphs
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three
- Rainbow triangles in arc-colored digraphs
- A classification of edge-colored graphs based on properly colored walks
- Color degree sum conditions for properly colored spanning trees in edge-colored graphs
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
- Complete graphs and complete bipartite graphs without rainbow path
- Properly colored 2-factors of edge-colored complete bipartite graphs
- The minimum color degree and a large rainbow cycle in an edge-colored graph.
- Color degree and heterochromatic cycles in edge-colored graphs
- scientific article; zbMATH DE number 6470879 (Why is no real title available?)
- Edge‐colored complete graphs without properly colored even cycles: A full characterization
- Edge-disjoint properly colored cycles in edge-colored complete graphs
- Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs
- Properly colored and rainbow C4 ${C}_{4}$'s in edge‐colored graphs
- Counting rainbow triangles in edge-colored graphs
- Rainbow triangles sharing one common vertex or edge
- Properly colored even cycles in edge-colored complete balanced bipartite graphs
- Properly colored cycles in edge-colored complete graphs
- Properly colored cycles in edge-colored balanced bipartite graphs
- The parameterized complexity of the properly colored spanning tree problem
This page was built for publication: Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4638635)
