Skip to main content
SpringerLink
Log in

Two Conjectures on the Chromatic Polynomial

  • Conference paper
  • First Online:
LATIN 2000: Theoretical Informatics (LATIN 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1776))

Included in the following conference series:

  • 1061 Accesses

Abstract

We propose two conjectures on the chromatic polynomial of a graph and show their validity for several classes of graphs. Our conjectures are stronger than an older conjecture of Bartels and Welsh [1].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bartels, J.E., Welsh, D.: The Markov Chain of Colourings. In: Balas, E., Clausen, J. (eds.) IPCO 1995. LNCS, vol. 920. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  2. Dong, F.M.: Proof of a Chromatic Polynomial Conjecture. To appear on J. of Combin. Theory Ser. B

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, McGill University, 3480 University Street, Montreal, Canada, H3A2A7

    David Avis

  2. Istituto di Analisi dei Sistemi ed Informatica (IASI), CNR, Viale Manzoni 30, 00185, Rome, Italy

    Caterina De Simone

  3. Dipartimento di Matematica, Università di Lecce and IASI-CNR, Via Arnesano, 73100, Lecce, Italy

    Paolo Nobili

Authors
  1. David Avis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Caterina De Simone
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paolo Nobili
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. ETH Zurich, Institute of Computational Science, CH-8092 Zurich and, Swiss Institute of Bioinformatics, Switzerland

    Gaston H. Gonnet

  2. Pedeciba Informática, Casilla de Correo 16120, Distrito 6, Montevideo, Uruguay

    Alfredo Viola

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Avis, D., De Simone, C., Nobili, P. (2000). Two Conjectures on the Chromatic Polynomial. In: Gonnet, G.H., Viola, A. (eds) LATIN 2000: Theoretical Informatics. LATIN 2000. Lecture Notes in Computer Science, vol 1776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10719839_17

Download citation

  • DOI: https://doi.org/10.1007/10719839_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67306-4

  • Online ISBN: 978-3-540-46415-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation