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

Chromatic uniqueness in a family of 2-connected graphs

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

DOI10.1016/S0012-365X(96)00039-8zbMath0880.05039MaRDI QIDQ1356689

Halina Bielak

Publication date: 14 January 1998

Published in: Discrete Mathematics (Search for Journal in Brave)


zbMATH Keywords

chromatic polynomialchromatically equivalentchromatically unique


Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)





Cites Work

  • The search for chromatically unique graphs
  • Chromatically unique graphs
  • Parallel concepts in graph theory
  • An introduction to chromatic polynomials




This page was built for publication: Chromatic uniqueness in a family of 2-connected graphs

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