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

Graphs and the multiplicity of root 2 in chromatic polynomials

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

zbMATH Open1002.05029MaRDI QIDQ2721569

Yunhua Zang

Publication date: 9 October 2002

Published in: Journal of Mathematical Research \& Exposition (Search for Journal in Brave)




zbMATH Keywords

blocknon-bipartite graphs


Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)



Related Items (1)

The 224 non-chordal graphs on less than 10 vertices whose chromatic polynomials have no complex roots


Recommendations

  • Title not available (Why is that?) πŸ‘ πŸ‘Ž
  • Title not available (Why is that?) πŸ‘ πŸ‘Ž
  • Title not available (Why is that?) πŸ‘ πŸ‘Ž
  • On chromatic polynomials of some kinds of graphs πŸ‘ πŸ‘Ž
  • On the roots of chromatic polynomials πŸ‘ πŸ‘Ž
  • Non-chordal graphs having integral-root chromatic polynomials. II πŸ‘ πŸ‘Ž
  • Multiplicity of integer roots of polynomials of graphs πŸ‘ πŸ‘Ž
  • On chordal graphs and their chromatic polynomials πŸ‘ πŸ‘Ž
  • Integral-root polynomials and chromatic uniqueness of graphs πŸ‘ πŸ‘Ž
  • Roots of chromatic polynomials πŸ‘ πŸ‘Ž





This page was built for publication: Graphs and the multiplicity of root 2 in chromatic polynomials

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2721569&oldid=15575381"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 14:30.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki