Combinatorial properties of a general domination problem with parity constraints

DOI10.1016/J.DISC.2007.12.005MaRDI QIDQ998375zbMATH OpenOpenAlexFDO

Authors Johannes Hatzl, Stephan 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)

Recommendations

• On the generalization of the matroid parity problem
• Parameterized complexity of generalized domination problems
• Parameterized Complexity of Generalized Domination Problems
• Parameterized Algorithms for Generalized Domination
• Publication:5251996
• Algorithmic aspects of paired disjunctive domination in graphs
• Domination parameters of a graph and its complement
• On domination problems for permutation and other graphs
• Publication:3715153
• Combinatorial dominance guarantees for problems with infeasible solutions

Cites work

• scientific article; zbMATH DE number 436064 (Why is no real title available?)
• scientific article; zbMATH DE number 3914370 (Why is no real title available?)
• scientific article; zbMATH DE number 3914371 (Why is no real title available?)
• scientific article; zbMATH DE number 566078 (Why is no real title available?)
• scientific article; zbMATH DE number 871170 (Why is no real title available?)
• scientific article; zbMATH DE number 1420902 (Why is no real title available?)
• scientific article; zbMATH DE number 1444486 (Why is no real title available?)
• A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs
• Analytic combinatorics
• Asymptotic Methods in Enumeration
• Counting all parity realizable trees
• Differentials in graphs
• Enumeration of labelled multigraphs by degree parities
• Linear cellular automata and the garden-of-eden
• Parity Dimension for Graphs - A Linear Algebraic Approach
• Parity dimension for graphs
• Parity dominating sets in grid graphs
• Remarks on an asymptotic method in combinatorics
• Singularity Analysis of Generating Functions
• Universal configurations in light-flipping games

Cited in

(3)

• Extremal trees with fixed degree sequence
• A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs
• Parity dimension for graphs

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

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