List rainbow connection number of graphs
From MaRDI portal
Cites work
- A characterization of the non-trivial diameter two graphs of minimum size
- A solution to a conjecture on two rainbow connection numbers of a graph.
- Combinatorial Nullstellensatz
- Computing the list chromatic index of graphs
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- scientific article; zbMATH DE number 3563170 (Why is no real title available?)
- scientific article; zbMATH DE number 1123764 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 2192112 (Why is no real title available?)
- List-colourings of graphs
- On Representatives of Subsets
- On the choosability of complete multipartite graphs with part size three
- On various (strong) rainbow connection numbers of graphs
- Rainbow connection in graphs
This page was built for publication: List rainbow connection number of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7262703)