Partitions and Their Representative Graphs
From MaRDI portal
Publication:5808058
DOI10.2307/2372318zbMath0044.38202OpenAlexW2334513187MaRDI QIDQ5808058
Publication date: 1951
Published in: American Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2372318
Related Items
Graph realizations constrained by skeleton graphs ⋮ On realization graphs of degree sequences ⋮ Enumerating Possible Molecular Formulae in Mass Spectrometry Using a Generating Function Based Method ⋮ Adjacency matrices of random digraphs: singularity and anti-concentration ⋮ A new class of enumeration problems ⋮ Counting chemical compositions using Ehrhart quasi-polynomials ⋮ Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs ⋮ Characterization of Digraphic Sequences with Strongly Connected Realizations ⋮ On minimum generalized degree distance index of cyclic graphs ⋮ Subgraphs and their degree sequences of a digraph ⋮ A fast algorithm and software for analysis of FT-ICR data ⋮ On complete systems of invariants for small graphs ⋮ The spectral gap of dense random regular graphs ⋮ Approximating Shortest Connected Graph Transformation for Trees ⋮ Unicyclic and bicyclic graphs having minimum degree distance ⋮ A NOTE ON TRICYCLIC GRAPHS WITH MINIMUM DEGREE DISTANCE ⋮ Anti-concentration property for random digraphs and invertibility of their adjacency matrices ⋮ Minimum generalized degree distance of \(n\)-vertex tricyclic graphs ⋮ On the Swap-Distances of Different Realizations of a Graphical Degree Sequence ⋮ On the realization of a (p,s)-digraph with prescribed degrees ⋮ Relations between graphs and integer-pair sequences ⋮ Simple directed trees ⋮ Fragmentation Trees Reloaded ⋮ On the degrees of the vertices of a directed graph ⋮ The Perfect Matching Reconfiguration Problem ⋮ Cliques in realization graphs
