The following pages link to Graphs that Split Entropies (Q3033797):
Displaying 18 items.
- On equistable, split, CIS, and related classes of graphs (Q344829) (← links)
- Symmetric graphs with respect to graph entropy (Q510346) (← links)
- Entropy splitting for antiblocking corners and perfect graphs (Q810528) (← links)
- Partitioning multi-dimensional sets in a small number of ``uniform'' parts (Q854815) (← links)
- Entropy of symmetric graphs (Q898092) (← links)
- Constructions for normal graphs and some consequences (Q1003480) (← links)
- Perfect couples of graphs (Q1196687) (← links)
- The normal graph conjecture for two classes of sparse graphs (Q1706428) (← links)
- On the capacity of Boolean graph formulæ (Q1805371) (← links)
- Entropy splitting hypergraphs (Q1924130) (← links)
- Some bounds of weighted entropies with augmented Zagreb index edge weights (Q2004176) (← links)
- Disproving the normal graph conjecture (Q2222050) (← links)
- Extremality of graph entropy based on degrees of uniform hypergraphs with few edges (Q2311742) (← links)
- Sorting under partial information (without the ellipsoid algorithm) (Q2439837) (← links)
- Perfect graphs and graph entropy: An updated survey (Q2758342) (← links)
- Graph pairs and their entropies: Modularity problems (Q5928569) (← links)
- Poset entropy versus number of linear extensions: the width-2 case. (Q5965137) (← links)
- Generalizing Körner's graph entropy to graphons (Q6080368) (← links)
