Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

The chromatic number of extended odd graphs is four

From MaRDI portal
Jump to:navigation, search

DOI10.21136/CPM.1987.118312zbMATH Open0667.05023OpenAlexW3047833342WikidataQ114046923 ScholiaQ114046923MaRDI QIDQ3819086FDOQ3819086

Marie Sokolová

Publication date: 1987


Full work available at URL: https://eudml.org/doc/21678



zbMATH Keywords

chromatic numberodd graph


Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)



Cited In (5)

  • Chromatic numbers of Cayley graphs of abelian groups: a matrix method
  • Title not available (Why is that?)
  • On 3-chromatic distance-regular graphs
  • Characterization of Laborde-Mulder graphs (extended odd graphs)
  • On the chromatic number of cube-like graphs


   Recommendations
  • On the chromatic number of the general Kneser-graph 👍 👎
  • Title not available (Why is that?) 👍 👎
  • Title not available (Why is that?) 👍 👎
  • Chromatic partitions of a graph 👍 👎
  • Star chromatic number 👍 👎





This page was built for publication: The chromatic number of extended odd graphs is four

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3819086)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3819086&oldid=17400884"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 15:21. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki