Formalization of the Domination Chain with Weighted Parameters (Short Paper)

DOI10.4230/LIPICS.ITP.2019.36MaRDI QIDQ5875450zbMATH OpenOpenAlexFDO

Authors D. Severín

Publication date 3 February 2023

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2019/11091/pdf/LIPIcs-ITP-2019-36.pdf

zbMATH Keywords

Coqdomination chainformalization of mathematics

Mathematics Subject Classification ID

Cites work

• A formal proof of the minor-exclusion property for treewidth-two graphs
• An introduction to small scale reflection in Coq
• Chordal graphs and upper irredundance, upper domination and independence
• Formal proof - the four color theorem
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• Proof pearl: a probabilistic proof for the girth-chromatic number theorem
• The many facets of upper domination
• The weighted independent domination problem: integer linear programming models and metaheuristic approaches
• Total irredundance in graphs
• Weighted upper domination number

Cited in

(2)

• Graph theory in Coq: minors, treewidth, and isomorphisms
• On the maximum weighted irredundant set problem

Describes a project that uses

Uses Software

• Coq/SSReflect

This page was built for publication: Formalization of the Domination Chain with Weighted Parameters (Short Paper)

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