A simple criterion on degree sequences of graphs
From MaRDI portal
Publication:1003744
DOI10.1016/J.DAM.2008.03.033zbMATH Open1168.05307OpenAlexW2134970753MaRDI QIDQ1003744FDOQ1003744
Authors: Amitabha Tripathi, Himanshu Tyagi 
Publication date: 4 March 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.03.033
Recommendations
degree sequencegraphic sequencegraphically equivalent sequenceperfect degree sequencequasi-perfect degree sequence
Cites Work
- Title not available (Why is that?)
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- A note on a theorem of Erdős and Gallai
- Algorithms for constructing graphs and digraphs with given valences and factors
- A remark on the existence of finite graphs
- Seven criteria for integer sequences being graphic
- Degree sets for graphs
- Title not available (Why is that?)
- A simple proof of the Erdos-Gallai theorem on graph sequences
- A short proof of a theorem on degree sets of graphs
- Title not available (Why is that?)
- No Graph is Perfect
Cited In (50)
- A semigroup proof of the bounded degree case of S.B. Rao's conjecture on degree sequences and a bipartite analogue
- A triangle process on regular graphs
- Title not available (Why is that?)
- On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition
- Constructive extensions of two results on graphic sequences
- Title not available (Why is that?)
- Methods for the graph realization problem
- Relaxed and approximate graph realizations
- Reduced criteria for degree sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Degree sequences of join and corona products of graphs
- A simple proof of the Erdos-Gallai theorem on graph sequences
- On Erdös-Gallai and Havel-Hakimi algorithms
- A sharp refinement of a result of Zverovich-Zverovich
- Degree polynomial for vertices in a graph and its behavior under graph operations
- A short constructive proof of A.R. Rao's characterization of potentially \(K_{r+1}\)-graphic sequences
- AROUND THE ERDÖS–GALLAI CRITERION
- A short constructive proof of the Erdős-Gallai characterization of graphic lists
- Recognition of split-graphic sequences
- Graphic deviation
- Graph realizations: maximum degree in vertex neighborhoods
- An improvement of a result of Zverovich-Zverovich
- Algebraic structure of graph operations in terms of degree sequences
- A note on a theorem of Erdős and Gallai
- Graphs with a given degree sequence
- Degree sequences in graphs
- Title not available (Why is that?)
- Graphs and degree sequences: A survey. III
- Hereditary unigraphs and Erdős-Gallai equalities
- Omega invariant of graphs and cyclicness
- Independence number of graphs and line graphs of trees by means of omega invariant
- Vertex-weighted graphs: realizable and unrealizable domains
- Graphs and degree sequences. II
- A characterization of the degree sequence of the graph with cyclomatic number \(k\).
- Vertex-weighted realizations of graphs
- Graphs with the strong Havel-Hakimi property
- Packing tree degree sequences
- Degree sequence of graph operator for some standard graphs
- A remark concerning graphical sequences
- On vertex-weighted realizations of acyclic and general graphs
- On vertex-weighted graph realizations
- Title not available (Why is that?)
- A remark on degree sequences of multigraphs
- Forcibly bipartite and acyclic (uni-)graphic sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
- Seven criteria for integer sequences being graphic
- The degree sequence of the graph with cyclomatic number less than four.
This page was built for publication: A simple criterion on degree sequences of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1003744)
