Rao's theorem for forcibly planar sequences revisited
From MaRDI portal
Publication:6570032
Recommendations
- On unigraphic polyhedra with one vertex of degree \({p-2}\)
- A short constructive proof of A.R. Rao's characterization of potentially \(K_{r+1}\)-graphic sequences
- Forcibly bipartite and acyclic (uni-)graphic sequences
- Characterising \(3\)-polytopes of radius one with unique realisation
- Two short proofs of the bounded case of S. B. Rao's degree sequence conjecture
Cites work
- scientific article; zbMATH DE number 3811626 (Why is no real title available?)
- scientific article; zbMATH DE number 3509333 (Why is no real title available?)
- A remark on the existence of finite graphs
- An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences
- Characterising \(3\)-polytopes of radius one with unique realisation
- Forcibly-biconnected Graphical Degree Sequences: Decision Algorithms and Enumerative Results
- Graphic sequences with unique realization
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- On realizing a single degree sequence by a bipartite graph
- On the necessity of Chvátal's Hamiltonian degree condition
- On unigraphic polyhedra with one vertex of degree \({p-2}\)
- Sequences with a unique realization by simple graphs
- Sufficient degree conditions for \(k\)-edge-connectedness of a graph
- Toughness and vertex degrees
Cited in
(3)
This page was built for publication: Rao's theorem for forcibly planar sequences revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570032)
