Paths and cycles in colored graphs
From MaRDI portal
Recommendations
Cited in
(19)- Color neighborhood union conditions for long heterochromatic paths in edge-colored graphs
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- The heterochromatic cycles in edge-colored graphs
- Binary constraint satisfaction problems defined by excluded topological minors
- Algorithms and complexity for a class of combinatorial optimization problems with labelling
- From colourful to rainbow paths in graphs: colouring the vertices
- Cycles in color-critical graphs
- Zeons, orthozeons, and graph colorings
- Paths and trails in edge-colored graphs
- A generalization of properly colored paths and cycles in edge-colored graphs
- Colorful paths in vertex coloring of graphs.
- Properly colored paths and cycles in complete graphs
- Color degree and heterochromatic paths in edge-colored graphs.
- Cycles and paths in edge‐colored graphs with given degrees
- Bounds of the number of IMP-sets in edge-coloured graphs
- scientific article; zbMATH DE number 2147947 (Why is no real title available?)
- scientific article; zbMATH DE number 762736 (Why is no real title available?)
- scientific article; zbMATH DE number 6453675 (Why is no real title available?)
- Colorful paths in vertex coloring of graphs
This page was built for publication: Paths and cycles in colored graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2816051)
