Conjecture of TxGraffiti: Independence, domination, and matchings
From MaRDI portal
Publication:5869457
zbMath1497.05202arXiv2104.01092MaRDI QIDQ5869457
Ryan Pepper, Yair Caro, Randy Davila, Michael A. Henning
Publication date: 28 September 2022
Full work available at URL: https://arxiv.org/abs/2104.01092
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence
- A new lower bound on the independence number of a graph and applications
- Upper bounds on the \(k\)-forcing number of a graph
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Facet defining inequalities among graph invariants: The system graphedron
- Independence, clique size and maximum degree
- Matching theory
- Complexity of the hamiltonian cycle in regular graph problem
- Claw-free graphs---a survey
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- On the independent domination number of regular graphs
- New approach to the \(k\)-independence number of a graph
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- New results relating independence and matchings
- Domination versus independent domination in graphs of small regularity
- Domination versus edge domination
- Zero forcing in claw-free cubic graphs
- On the \(k\)-independence number of graphs
- Independent sets in regular graphs
- On \(k\)-domination and \(j\)-independence in graphs
- Degree Sequence Index Strategy
- AutoGraphiX: a survey
- On the residue of a graph
- Improved lower bounds on k‐independence
- Total Domination in Graphs
- Structures of Domination in Graphs
- Topics in Domination in Graphs
This page was built for publication: Conjecture of TxGraffiti: Independence, domination, and matchings
