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

DOI10.4230/LIPIcs.ITP.2019.36OpenAlexW2991473849MaRDI QIDQ5875450

Daniel 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

formalization of mathematicsCoqdomination chain

Mathematics Subject Classification ID

Related Items (1)

Graph theory in Coq: minors, treewidth, and isomorphisms

Uses Software

• Coq/SSReflect

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chordal graphs and upper irredundance, upper domination and independence
• The weighted independent domination problem: integer linear programming models and metaheuristic approaches
• The many facets of upper domination
• A formal proof of the minor-exclusion property for treewidth-two graphs
• Total irredundance in graphs
• Weighted upper domination number
• Proof Pearl: A Probabilistic Proof for the Girth-Chromatic Number Theorem
• A formalization of convex polyhedra based on the simplex method

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