Publication:3929766
From MaRDI portal
zbMath0474.05043MaRDI QIDQ3929766
No author found.
Publication date: 1981
Related Items
Difference graphs, Composed degree-distance realizations of graphs, Composed degree-distance realizations of graphs, Forcibly bipartite and acyclic (uni-)graphic sequences, Graph realizations: maximum degree in vertex neighborhoods, Largest domination number and smallest independence number of forests with given degree sequence, Graphic sequences and split graphs, A degree sequence variant of graph Ramsey numbers, Graphic sequences with a realization containing a union of cliques, Score vectors of Kotzig tournaments, Potentially 2-connected integer pair sequences, The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true, On forcibly connected graphic sequences, Efficient counting of degree sequences, Adjacency relationships forced by a degree sequence, On forcibly hereditary P-graphical sequences, Vertex-weighted graphs: realizable and unrealizable domains, Recognition of split-graphic sequences, On the potential function of an arbitrary graph \(H\), On a problem of potentially pancyclic-graphic sequences due to S.B. Rao, Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem, Graphs and degree sequences. I
