Graph pairs and their entropies: Modularity problems
From MaRDI portal
Publication:5928569
DOI10.1007/s004930070022zbMath0959.05040OpenAlexW4552026MaRDI QIDQ5928569
Publication date: 1 April 2001
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930070022
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Measures of information, entropy (94A17)
Related Items (20)
A conjecture on Gallai-Ramsey numbers of even cycles and paths ⋮ Information theoretic parameters of noncommutative graphs and convex corners ⋮ Gallai-Ramsey numbers of $C_{10}$ and $C_{12}$ ⋮ On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems ⋮ Gallai-Ramsey numbers of \(C_7\) with multiple colors ⋮ Extremal problems and results related to Gallai-colorings ⋮ Gallai colorings and domination in multipartite digraphs ⋮ Gallai colorings of non-complete graphs ⋮ Decomposing complete edge-chromatic graphs and hypergraphs. Revisited ⋮ The Erdős-Hajnal conjecture for rainbow triangles ⋮ Ramsey-type results for Gallai colorings ⋮ Gallai and \(\ell \)-uniform Ramsey numbers of complete bipartite graphs ⋮ A note on Gallai-Ramsey number of even wheels ⋮ The Typical Structure of Gallai Colorings and Their Extremal Graphs ⋮ Counting Gallai 3-colorings of complete graphs ⋮ Gallai-Ramsey number of even cycles with chords ⋮ Edge colorings of complete graphs without tricolored triangles ⋮ The number of Gallai \(k\)-colorings of complete graphs ⋮ Gallai-Ramsey number of odd cycles with chords ⋮ Disconnected Colors in Generalized Gallai-Colorings
This page was built for publication: Graph pairs and their entropies: Modularity problems
