Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph

descriptionPublicationkeyboard_double_arrow_right Article 01 Sep 1996 English Publisher:Springer Science and Business Media LLCJournal:Combinatorica, volume 16, pages 383-397 (issn: 0209-9683, eissn: 1439-6912,

Copyright policy )

Authors: Nabil Kahalé; Leonard J. Schulman;

doi: 10.1007/bf01261322

Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

University of California, Berkeley
United States
Massachusetts Institute of Technology
United States

Keywords

Extremal problems in graph theory, Coloring of graphs and hypergraphs, acyclic orientations, Graphs and linear algebra (matrices, eigenvalues, etc.), upper bound, chromatic polynomial, Laplacian, lower bound, spectrum

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	9
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average