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