Properly colored paths and cycles in edge colored graphs
From MaRDI portal
Publication:4901770
Recommendations
- scientific article; zbMATH DE number 6453675
- Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result
- Properly colored paths and cycles
- Cycles and paths in edge‐colored graphs with given degrees
- Properly coloured Hamiltonian paths in edge-coloured complete graphs without monochromatic triangles
Cited in
(14)- Coloring graphs without bichromatic cycles or paths
- A classification of edge-colored graphs based on properly colored walks
- Paths and trails in edge-colored graphs
- Properly coloured Hamiltonian paths in edge-coloured complete graphs without monochromatic triangles
- Properly colored paths and cycles in complete graphs
- Cycles and paths in edge‐colored graphs with given degrees
- scientific article; zbMATH DE number 6667033 (Why is no real title available?)
- scientific article; zbMATH DE number 4075110 (Why is no real title available?)
- scientific article; zbMATH DE number 762736 (Why is no real title available?)
- The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles
- Odd properly colored cycles in edge-colored graphs
- scientific article; zbMATH DE number 6453675 (Why is no real title available?)
- A Dirac type condition for properly coloured paths and cycles
- Colorful paths in vertex coloring of graphs
This page was built for publication: Properly colored paths and cycles in edge colored graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4901770)
