Chromatic polynomials and network reliability
type: Item
instance of: scholarly article
title: Chromatic polynomials and network reliability
zbMATH Open document ID: 0647.05024
DOI: 10.1016/0012-365X(87)90166-X
author: S. H. Smith
published in: Discrete Mathematics
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 90B25
Mathematics Subject Classification ID: 94C15
zbMATH DE Number: 4055640
zbMATH Keywords: chromatic polynomial
zbMATH Keywords: axiomatic characterization
zbMATH Keywords: topological characterizations
zbMATH Keywords: number of acyclic orientations
zbMATH Keywords: network reliability
MaRDI profile type: Publication
cites work: A Survey of Network Reliability and Domination Theory
cites work: Some Alternate Characterizations of Reliability Domination
cites work: Parallel concepts in graph theory
cites work: Q3198681
cites work: An introduction to chromatic polynomials
cites work: A Unified Formula for Analysis of Some Network Reliability Problems
cites work: Network reliability and the factoring theorem
cites work: On an Invariant of Graphs and the Reliability Polynomial
cites work: New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks
cites work: Acyclic orientations of graphs
cites work: A Contribution to the Theory of Chromatic Polynomials
Recommended article: Polyhedral Combinatorics and Network Reliability
Recommended article: Chromatic, Flow and Reliability Polynomials: The Complexity of their Coefficients
Recommended article: A generalized chromatic polynomial, acyclic orientations with prescribed sources and sinks, and network reliability
Recommended article: Chromatic polynomials of random graphs
Recommended article: Q4294637
Recommended article: Chromatic polynomials of connected graphs
Recommended article: Q4860309
Recommended article: Q3822188
Recommended article: Chromatic polynomials of hypergraphs
description: scientific article; zbMATH DE number 4055640