Color chain of a graph
From MaRDI portal
Publication:659728
DOI10.1007/S00373-010-0989-7zbMATH Open1244.05086OpenAlexW2125677183MaRDI QIDQ659728FDOQ659728
Publication date: 24 January 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-010-0989-7
Recommendations
- scientific article; zbMATH DE number 6986950
- Graph colorings
- scientific article; zbMATH DE number 3935075
- Coloring chains
- Rainbow colourings of chains
- Color-induced graph colorings
- Color-induced graph colorings
- Color connection in graphs intermediate to proper and rainbow connection
- Color stable graphs
- The color space of a graph
chromatic number\(b\)-Chromatic numberFall achromatic numberFall chromatic numberPartial Grundy number and achromatic number
Cites Work
- The b-chromatic number of a graph
- The achromatic number of a graph
- On the equality of the partial Grundy and upper ochromatic numbers of graphs
- Fall colouring of bipartite graphs and Cartesian products of graphs
- An algorithm for partial Grundy number on trees
- Fall coloring of graphs I
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: Color chain of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659728)