Graphs that Split Entropies

DOI10.1137/0401008zbMath0692.05054MaRDI QIDQ3033797

No author found.

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1137/0401008

zbMATH Keywords

network flows; perfect graphs; graph entropy; graph covering

Mathematics Subject Classification ID

90B10: Deterministic network models in operations research

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C75: Structural characterization of families of graphs

94A15: Information theory (general)

Related Items

Constructions for normal graphs and some consequences, Perfect couples of graphs, On the capacity of Boolean graph formulæ