Combinatorial properties of a general domination problem with parity constraints

DOI10.1016/J.DISC.2007.12.005zbMATH Open1157.05043OpenAlexW2108808715MaRDI QIDQ998375FDOQ998375

Stephan Wagner, Johannes Hatzl

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

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
• scientific article; zbMATH DE number 6438426
• Algorithmic aspects of paired disjunctive domination in graphs
• Domination parameters of a graph and its complement
• On domination problems for permutation and other graphs
• scientific article; zbMATH DE number 3943870
• Combinatorial dominance guarantees for problems with infeasible solutions

zbMATH Keywords

matrix algebradomination problemparity constraint

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Singularity Analysis of Generating Functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Linear cellular automata and the garden-of-eden
• Title not available (Why is that?)
• Differentials in graphs
• Title not available (Why is that?)
• Parity dimension for graphs
• Asymptotic Methods in Enumeration
• Parity Dimension for Graphs - A Linear Algebraic Approach
• Title not available (Why is that?)
• Title not available (Why is that?)
• Universal configurations in light-flipping games
• Parity dominating sets in grid graphs
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Extremal trees with fixed degree sequence
• Parity dimension for graphs
• A parity domination problem in graphs with bounded treewidth and distance-hereditary 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)