Colorful paths in vertex coloring of graphs.
From MaRDI portal
Recommendations
- Colorful paths in vertex coloring of graphs
- From colourful to rainbow paths in graphs: colouring the vertices
- Paths and cycles in colored graphs
- scientific article; zbMATH DE number 2147947
- Color degree and heterochromatic paths in edge-colored graphs.
- scientific article; zbMATH DE number 762736
- On proper-path colorings in graphs
- Colorful paths for 3-chromatic graphs
- Coloring hypercomplete and hyperpath graphs
Cited in
(12)- Coloring graphs without bichromatic cycles or paths
- From colourful to rainbow paths in graphs: colouring the vertices
- Optimal colorings with rainbow paths
- scientific article; zbMATH DE number 6667033 (Why is no real title available?)
- A colourful path
- scientific article; zbMATH DE number 762736 (Why is no real title available?)
- Colorful paths for 3-chromatic graphs
- Rainbow paths with prescribed ends
- On the complexity of the colorful directed paths in vertex coloring of digraphs
- Colorings of complements of line graphs
- Colorful paths in vertex coloring of graphs
- Simple proofs of results on paths representing all colors in proper vertex-colorings
This page was built for publication: Colorful paths in vertex coloring of graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828929)
