On Generating Triangle-Free Graphs

@article{Brgmann2009OnGT,
  title={On Generating Triangle-Free Graphs},
  author={Daniel Br{\"u}gmann and Christian Komusiewicz and Hannes Moser},
  journal={Electronic Notes in Discrete Mathematics},
  year={2009},
  volume={32},
  pages={51-58}
}
We show that the problem to decide whether a graph can be made triangle-free with at most k edge deletions remains NP-complete even when restricted to planar graphs of maximum degree seven. In addition, we provide polynomial-time data reduction rules for this problem and obtain problem kernels consisting of 6k vertices for general graphs and 11k/3 vertices for planar graphs. 
BETA

Similar Papers

Figures and Topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
SHOWING 1-10 OF 18 CITATIONS

References

Publications referenced by this paper.