Lower bounds on the differential of a graph

DOI10.1016/j.disc.2012.07.021zbMath1252.05089OpenAlexW2083887440MaRDI QIDQ713137

Henning Fernau, Sergio Bermudo

Publication date: 26 October 2012

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

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

zbMATH Keywords

differential of a graphlower bound results

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)

Related Items (13)

Relations between the differential and parameters in graphs ⋮ The differential of the line graph \(\mathcal{L} (G)\) ⋮ On the differential and Roman domination number of a graph with minimum degree two ⋮ \(W_2\)-graphs and shedding vertices ⋮ Differential in complementary prisms ⋮ Data reductions and combinatorial bounds for improved approximation algorithms ⋮ Computing the differential of a graph: hardness, approximability and exact algorithms ⋮ Combinatorics for smaller kernels: the differential of a graph ⋮ On the differential polynomial of a graph ⋮ A proof of a conjecture on the differential of a subcubic graph ⋮ 1-well-covered graphs revisited ⋮ The differential of the strong product graphs ⋮ \(\beta\)-differential of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the differential of a graph: hardness, approximability and exact algorithms
• Domination in graphs with minimum degree two
• Enclaveless sets and MK-Systems
• Paths, Stars and the Number Three
• Automata, Languages and Programming
• SOFSEM 2006: Theory and Practice of Computer Science

This page was built for publication: Lower bounds on the differential of a graph