Loop zero forcing and Grundy domination in planar graphs and claw-free cubic graphs

DOI10.1007/s40840-024-01705-4zbMATH Open1546.05109MaRDI QIDQ6564843

Alex Domat, Kirsti Kuenzel

Publication date: 1 July 2024

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

zbMATH Keywords

graph coloringplanar graphscubic graphzero forcingGrundy domination

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Perfect matchings in claw-free cubic graphs
• Dominating sequences in graphs
• Minimum rank problems
• Zero forcing number, Grundy domination number, and their variants
• Grundy dominating sequences and zero forcing sets
• Power domination in cubic graphs and Cartesian products
• Zero forcing in claw-free cubic graphs
• Zero forcing in triangulations
• Zero forcing sets and the minimum rank of graphs
• Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph

This page was built for publication: Loop zero forcing and Grundy domination in planar graphs and claw-free cubic graphs