On Planar Graphical Degree Sequences
From MaRDI portal
Publication:4137200
DOI10.1137/0132048zbMath0363.05029OpenAlexW2000204877MaRDI QIDQ4137200
S. Louis Hakimi, Edward F. Schmeichel
Publication date: 1977
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0132048
Related Items
The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence, Planar bipartite biregular degree sequences, An algorithm for the characterization of the nonplanarity of a maximal graphical partition, On existence of hypergraphs with prescribed edge degree profile, Unnamed Item, Extremal \(H\)-free planar graphs, Lower bounds on the cardinality of the maximum matchings of planar graphs, On the maximum number of edges in planar graphs of bounded degree and matching number, Constructing certain families of 3‐polytopal graphs, Graph realizations: maximum degree in vertex neighborhoods, Subgraphs and their degree sequences of a digraph, An unresolved conjecture on nonmaximal planar graphical sequences, Characterization of optimal key set protocols, A Characterization of the degree sequences of 2-trees, Unnamed Item, Bounds on the number of cycles of length three in a planar graph, The splittance of a graph, On the existence and connectivity of a class of maximal planar graphs, Graphs and degree sequences. I, On the discrepancy between two Zagreb indices, Relaxed and approximate graph realizations