Chromatic polynomials and network reliability

DOI10.1016/0012-365X(87)90166-XzbMath0647.05024MaRDI QIDQ1104334

S. H. Smith

Publication date: 1987

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

zbMATH Keywords

chromatic polynomialnetwork reliabilityaxiomatic characterizationtopological characterizationsnumber of acyclic orientations

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Coloring of graphs and hypergraphs (05C15) Applications of graph theory to circuits and networks (94C15)

Related Items (6)

Matroid Steiner problems, the Tutte polynomial and network reliability ⋮ A bibliography on chromatic polynomials ⋮ Generalized activities and \(K\)-terminal reliability ⋮ A generalized chromatic polynomial, acyclic orientations with prescribed sources and sinks, and network reliability ⋮ A survey of some network reliability analysis and synthesis results ⋮ Some Alternate Characterizations of Reliability Domination

Cites Work

• Unnamed Item
• Parallel concepts in graph theory
• Acyclic orientations of graphs
• A Survey of Network Reliability and Domination Theory
• Some Alternate Characterizations of Reliability Domination
• On an Invariant of Graphs and the Reliability Polynomial
• A Unified Formula for Analysis of Some Network Reliability Problems
• New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks
• Network reliability and the factoring theorem
• An introduction to chromatic polynomials
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: Chromatic polynomials and network reliability