On Planar Graphical Degree Sequences

Cited in

(27)

An algorithm for the characterization of the nonplanarity of a maximal graphical partition
Lower bounds on the cardinality of the maximum matchings of planar graphs
Subgraphs and their degree sequences of a digraph
An unresolved conjecture on nonmaximal planar graphical sequences
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
Characterization of optimal key set protocols
Planar bipartite biregular degree sequences
On existence of hypergraphs with prescribed edge degree profile
Relaxed and approximate graph realizations
The structure matrix of the class of r-multigraphs with a prescribed degree sequence
Extremal \(H\)-free planar graphs
Graphs and degree sequences. I
Locally recoverable codes from planar graphs
On the maximum number of edges in planar graphs of bounded degree and matching number
Constructing certain families of 3‐polytopal graphs
scientific article; zbMATH DE number 7765789 (Why is no real title available?)
Graph realizations: maximum degree in vertex neighborhoods
Approximate realizations for outerplanaric degree sequences
Degree realization by bipartite cactus graphs
On bipartite graph realizations of a single degree sequence
Approximate realizations for outerplanaric degree sequences
On key parameters affecting the realizability of degree sequences (invited paper)
Sparse graphic degree sequences have planar realizations
On the discrepancy between two Zagreb indices
Degree realization by bipartite cactus graphs

This page was built for publication: On Planar Graphical Degree Sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4137200)