Partitions and Their Representative Graphs
From MaRDI portal
Cited in
(26)- Subgraphs and their degree sequences of a digraph
- On the realization of a (p,s)-digraph with prescribed degrees
- Relations between graphs and integer-pair sequences
- Simple directed trees
- The spectral gap of dense random regular graphs
- Counting chemical compositions using Ehrhart quasi-polynomials
- A fast algorithm and software for analysis of FT-ICR data
- Cliques in realization graphs
- Minimum generalized degree distance of n-vertex tricyclic graphs
- Graph realizations constrained by skeleton graphs
- Unicyclic and bicyclic graphs having minimum degree distance
- On the degrees of the vertices of a directed graph
- Fragmentation Trees Reloaded
- On realization graphs of degree sequences
- Characterization of digraphic sequences with strongly connected realizations
- A NOTE ON TRICYCLIC GRAPHS WITH MINIMUM DEGREE DISTANCE
- Adjacency matrices of random digraphs: singularity and anti-concentration
- Approximating shortest connected graph transformation for trees
- A new class of enumeration problems
- On complete systems of invariants for small graphs
- On the swap-distances of different realizations of a graphical degree sequence
- Enumerating possible molecular formulae in mass spectrometry using a generating function based method
- The Perfect Matching Reconfiguration Problem
- Anti-concentration property for random digraphs and invertibility of their adjacency matrices
- Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs
- On minimum generalized degree distance index of cyclic graphs
This page was built for publication: Partitions and Their Representative Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5808058)
