Vertex-edge domination in cubic graphs

DOI10.1016/j.disc.2020.112075zbMath1447.05164OpenAlexW3046755290MaRDI QIDQ2198396

Radosław Ziemann, Paweł Żyliński

Publication date: 10 September 2020

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

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

zbMATH Keywords

linear programmingcubic graphvertex-edge dominationdischarging method

Mathematics Subject Classification ID

Linear programming (90C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Total vertex-edge domination in graphs: Complexity and algorithms ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on independent vertex-edge domination in graphs
• Signed domination in regular graphs
• On vertex-edge and independent vertex-edge domination
• Dominating vertex covers: the vertex-edge domination problem
• On \(ve\)-degrees and \(ev\)-degrees in graphs
• Bounds on the vertex-edge domination number of a tree
• Complementary nil vertex edge dominating sets
• Planar 3DM is NP-complete
• On the Computational Complexity of Combinatorial Problems
• Total vertex-edge domination
• On the Algorithmic Complexity of Double Vertex-Edge Domination in Graphs
• Double vertex-edge domination
• Packing in regular graphs
• Vertex-edge domination in graphs
• Vertex-edge domination in unit disk graphs
• Vertex-edge domination in graphs