On a conjecture of \textit{TxGraffiti}: relating zero forcing and vertex covers in graphs

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15) Computational methods for problems pertaining to combinatorics (05-08)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Proof of a conjecture on the zero forcing number of a graph
Extremal values and bounds for the zero forcing number
Fast-mixed searching and related problems on graphs
Upper bounds on the \(k\)-forcing number of a graph
Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
On conjectures of Graffiti
Facet defining inequalities among graph invariants: The system graphedron
Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
Some bounds on the zero forcing number of a graph
Zero forcing in iterated line digraphs
Total forcing and zero forcing in claw-free cubic graphs
A lower bound on the zero forcing number
Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
Total forcing versus total domination in cubic graphs
Zero forcing versus domination in cubic graphs
New results relating independence and matchings
A short proof for a lower bound on the zero forcing number
Zero forcing in claw-free cubic graphs
Minimum rank and zero forcing number for butterfly networks
Zero forcing sets and the minimum rank of graphs
AutoGraphiX: a survey
A Graph Reduction Step Preserving Element-Connectivity and Applications
A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
Domination in Graphs Applied to Electric Power Networks
Dynamic approach to k-forcing
Conjecture of TxGraffiti: Independence, domination, and matchings

This page was built for publication: On a conjecture of \textit{TxGraffiti}: relating zero forcing and vertex covers in graphs

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