! Question about triangle-free problem in graph theory

From: Joe (Joe.ntang_at_gmail.com)
Date: 03/29/05

  • Next message: Matt Timmermans: "Re: Dynamic Programming Problem" 
    Date: 29 Mar 2005 04:48:12 -0800

    A graph is triangle-free if contains no triangle. Design a uniformly
    polynomial algorithm to determine whether an input graph contains k
    vertices, where k is the parameter, whose removal from G results in a
    triangle-free
    graph.

  • Next message: Matt Timmermans: "Re: Dynamic Programming Problem"

    Relevant Pages

    • Re: Some Thoughts on the Four Color Theorem
      ... this is not true for a MCE. ... The dual of the MCE is a triangle-free cubic planar graph." ... "3 The MCE must be the dual of a triangle-free cubic planar graph!" ...
      (sci.math)
    • Re: Loosing sync with GMFBridge
      ... input graph does not. ... pausing the render graph made no difference. ... My main concern is why the bridge I don't touch pauses. ...
      (microsoft.public.win32.programmer.directx.video)