Combinatorial properties of a general domination problem with parity constraints

DOI10.1016/j.disc.2007.12.005zbMath1157.05043OpenAlexW2108808715MaRDI QIDQ998375

Johannes Hatzl, Stephan G. Wagner

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.005

zbMATH Keywords

matrix algebradomination problemparity constraint

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Extremal trees with fixed degree sequence ⋮ A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs

Cites Work

• Remarks on an asymptotic method in combinatorics
• A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs
• Enumeration of labelled multigraphs by degree parities
• Parity dimension for graphs
• Linear cellular automata and the garden-of-eden
• Singularity Analysis of Generating Functions
• Asymptotic Methods in Enumeration
• Parity Dimension for Graphs - A Linear Algebraic Approach
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Combinatorial properties of a general domination problem with parity constraints