scientific article
From MaRDI portal
Publication:3941440
zbMath0483.05038MaRDI QIDQ3941440
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (20)
Largest domination number and smallest independence number of forests with given degree sequence ⋮ Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem ⋮ Realizability and uniqueness in graphs ⋮ Graphical sequences of some family of induced subgraphs ⋮ A further result on the potential-Ramsey number of G1 and G2 ⋮ The potential-Ramsey number of $K_n$ and $K_t^{-k}$ ⋮ The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true ⋮ A Rao-type characterization for a sequence to have a realization containing a split graph ⋮ An extension of A.R. Rao's characterization of potentially \(K_{m+1}\)-graphic sequences ⋮ Chromatic number and complete graph substructures for degree sequences ⋮ Best monotone degree conditions for graph properties: a survey ⋮ On matching numbers of tree and bipartite degree sequences ⋮ Recognition of split-graphic sequences ⋮ Graphic sequences with a realization containing cycles \(C_3, \dots, C_\ell \) ⋮ On multigraphic and potentially multigraphic sequences ⋮ The condition for a sequence to be potentially $A_{L, M}$- graphic ⋮ A degree sequence variant of graph Ramsey numbers ⋮ Conditions for \(r\)-graphic sequences to be potentially \(K^{(r)}_{m+1}\)-graphic ⋮ On the potentially \(P_k\)-graphic sequences ⋮ Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
This page was built for publication:
