Degree sequences of graphs and dominance order

DOI<89::AID-JGT12>3.0.CO;2-J 10.1002/(SICI)1097-0118(199605)22:1<89::AID-JGT12>3.0.CO;2-JzbMath0849.05063OpenAlexW4232475311MaRDI QIDQ4879171

Eberhard Triesch

Publication date: 22 May 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199605)22:1<89::aid-jgt12>3.0.co;2-j

zbMATH Keywords

partitionsdominancegraphical sequenceelimination sequence

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items

Largest domination number and smallest independence number of forests with given degree sequence ⋮ Realizability and uniqueness in graphs ⋮ Graphs with the strong Havel-Hakimi property ⋮ On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence ⋮ Partitions of graphs into small and large sets ⋮ MAX for \(k\)-independence in multigraphs ⋮ Havel-Hakimi residues of unigraphs ⋮ A lower bound on the independence number of a graph