On the Advantage over Random for Maximum Acyclic Subgraph

2007 ◽  
Author(s):  
Moses Charikar ◽  
Konstantin Makarychev ◽  
Yury Maka
Keyword(s):  
Acyclic Subgraph

On the maximum acyclic subgraph problem under disjunctive constraints

2015 ◽  
Vol 115 (2) ◽  
pp. 119-124
Author(s):  
Sílvia Maria Santana Mapa ◽  
Sebastián Urrutia
Keyword(s):  
Disjunctive Constraints ◽  
Acyclic Subgraph

On the acyclic subgraph polytope

1985 ◽  
Vol 33 (1) ◽  
pp. 28-42 ◽  
Author(s):  
Martin Grötschel ◽  
Michael Jünger ◽  
Gerhard Reinelt
Keyword(s):  
Acyclic Subgraph

scholarly journals Acyclic subgraph is hard

2018 ◽  
Author(s):  
Thinh D. Nguyen
Keyword(s):  
Graph Theory ◽  
Independent Set ◽  
Acyclic Subgraph

We prove the hardness of yet another problem in graph theory, namely Acyclic Subgraph. A reduction from Independent Set shows that our claim holds.

On the Point-Arboricity of a Graph and its Complement

1971 ◽  
Vol 23 (2) ◽  
pp. 287-292 ◽  
Author(s):  
John Mitchem
Keyword(s):  
Explicit Formula ◽  
Chromatic Number ◽  
Minimum Number ◽  
Point Set ◽  
Acyclic Subgraph ◽  
Image Position

The point-arboricity ρ (G) of a graph G is defined as the minimum number of subsets into which the point set V(G) of G may be partitioned so that each subset induces an acyclic subgraph. Equivalently, the point-arboricity of G may be defined as the least number of colours needed to colour the points of G so that no cycle of G has all of its points coloured the same. This term was introduced by Chartrand, Geller, and Hedetniemi [1], although the concept was first considered by Motzkin [4].As with the chromatic number of a graph G, which we denote by χ(G), there is no explicit formula for the point-arboricity of a graph. However, Nordhaus and Gaddum [5] have shown that if G is a graph with p points, then

Sign in / Sign up

Export Citation Format

Share Document