Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Color chain of a graph

From MaRDI portal
Publication:659728
Jump to:navigation, search

DOI10.1007/S00373-010-0989-7zbMath1244.05086OpenAlexW2125677183MaRDI QIDQ659728

R. Balakrishnan, T. Kavaskar

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


zbMATH Keywords

chromatic number\(b\)-Chromatic numberFall achromatic numberFall chromatic numberPartial Grundy number and achromatic number


Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)


Related Items (1)

The \(b\)-chromatic number and related topics -- a survey




Cites Work

  • Unnamed Item
  • Fall colouring of bipartite graphs and Cartesian products of graphs
  • The b-chromatic number of a graph
  • On the equality of the partial Grundy and upper ochromatic numbers of graphs
  • An algorithm for partial Grundy number on trees
  • Fall coloring of graphs I
  • The achromatic number of a graph




This page was built for publication: Color chain of a graph

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:659728&oldid=12563578"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 08:53.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki