Degree realization with minimum dominating set

DOI10.1007/978-3-032-28691-8_5MaRDI QIDQ7349445zbMATH OpenFDO

Authors Amotz Bar-Noy, Igor Kalinichev, David Peleg, Dror Rawitz

Publication date 16 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-28691-8_5

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Cites work

• A factorization theorem for a certain class of graphs
• A note on a theorem of Erdős and Gallai
• A Rao-type characterization for a sequence to have a realization containing a split graph
• A remark concerning graphical sequences
• A remark on the existence of finite graphs
• A short constructive proof of A.R. Rao's characterization of potentially \(K_{r+1}\)-graphic sequences
• A short constructive proof of the Erdős-Gallai characterization of graphic lists
• A simple criterion on degree sequences of graphs
• A simple proof of the Erdos-Gallai theorem on graph sequences
• A threshold of ln n for approximating set cover
• Algorithms for constructing graphs and digraphs with given valences and factors
• An algorithmic proof of Tutte's f-factor theorem
• Construction of Hamiltonian graphs and bigraphs with prescribed degrees
• Generalizations of the k-factor theorem
• scientific article; zbMATH DE number 3169205 (Why is no real title available?)
• scientific article; zbMATH DE number 3754758 (Why is no real title available?)
• scientific article; zbMATH DE number 3758373 (Why is no real title available?)
• scientific article; zbMATH DE number 1559563 (Why is no real title available?)
• Largest domination number and smallest independence number of forests with given degree sequence
• Linear degree extractors and the inapproximability of max clique and chromatic number
• On factorable degree sequences
• On matching numbers of tree and bipartite degree sequences
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Realizability and uniqueness in graphs
• Simplified existence theorems for \((g,f)\)-factors
• Smallest domination number and largest independence number of graphs and forests with given degree sequence
• Some Properties of Graphs with Multiple Edges
• The k-factor conjecture is true

This page was built for publication: Degree realization with minimum dominating set

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