Reduced criteria for degree sequences

DOI10.1016/j.disc.2012.11.027zbMath1259.05041arXiv1205.2686OpenAlexW2011959042MaRDI QIDQ1937566

Jeffrey W. Miller

Publication date: 1 March 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.2686

zbMATH Keywords

partitionadjacency matrixmajorizationdegree sequence

Mathematics Subject Classification ID

Vertex degrees (05C07)

Related Items (10)

Unnamed Item ⋮ Independence number of graphs and line graphs of trees by means of omega invariant ⋮ Sufficient Conditions for Graphicality of Bidegree Sequences ⋮ Degree realization by bipartite multigraphs ⋮ Degree sequence of graph operator for some standard graphs ⋮ A SUFFICIENT CONDITION FOR A PAIR OF SEQUENCES TO BE BIPARTITE GRAPHIC ⋮ An extension of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Connectedness criteria for graphs by means of omega invariant

This page was built for publication: Reduced criteria for degree sequences