Chromatic polynomials and network reliability
From MaRDI portal
Publication:1104334
DOI10.1016/0012-365X(87)90166-XzbMATH Open0647.05024MaRDI QIDQ1104334FDOQ1104334
Authors: S. H. Smith 
Publication date: 1987
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- Polyhedral Combinatorics and Network Reliability
- Chromatic, Flow and Reliability Polynomials: The Complexity of their Coefficients
- A generalized chromatic polynomial, acyclic orientations with prescribed sources and sinks, and network reliability
- Chromatic polynomials of random graphs
- scientific article; zbMATH DE number 568845
- Chromatic polynomials of connected graphs
- scientific article; zbMATH DE number 833904
- scientific article; zbMATH DE number 4095494
- Chromatic polynomials of hypergraphs
- Chromatic polynomials of hypergraphs
chromatic polynomialnetwork reliabilityaxiomatic characterizationtopological characterizationsnumber of acyclic orientations
Reliability, availability, maintenance, inspection in operations research (90B25) Coloring of graphs and hypergraphs (05C15) Applications of graph theory to circuits and networks (94C15)
Cites Work
- A Contribution to the Theory of Chromatic Polynomials
- A Survey of Network Reliability and Domination Theory
- New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks
- Acyclic orientations of graphs
- Parallel concepts in graph theory
- An introduction to chromatic polynomials
- Network reliability and the factoring theorem
- A Unified Formula for Analysis of Some Network Reliability Problems
- On an Invariant of Graphs and the Reliability Polynomial
- Title not available (Why is that?)
- Some Alternate Characterizations of Reliability Domination
Cited In (9)
- Matroid Steiner problems, the Tutte polynomial and network reliability
- A generalized chromatic polynomial, acyclic orientations with prescribed sources and sinks, and network reliability
- A bibliography on chromatic polynomials
- Title not available (Why is that?)
- A survey of some network reliability analysis and synthesis results
- A Set System Polynomial with Colouring and Reliability Applications
- Some Alternate Characterizations of Reliability Domination
- Generalized activities and \(K\)-terminal reliability
- Generalized activities and \(K\)-terminal reliability. II
This page was built for publication: Chromatic polynomials and network reliability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104334)
