Cyriac Antony's user avatar
Cyriac Antony's user avatar
Cyriac Antony's user avatar
Cyriac Antony
  • Member for 6 years, 2 months
  • Last seen more than a month ago
  • India
6 votes

Limited number of variable occurrences in 1-in-3 SAT

5 votes
Accepted

Maximum matching M with the condition G[M] is 2K_2-free

3 votes
Accepted

Hardness of approximating acyclic chromatic number

3 votes
Accepted

Graph labelling where vertices with a common neighbour get different labels

3 votes

Structural Complexity Theory References

2 votes

Exact algorithm for NAE-3SAT

2 votes

Who proved that a triangulation is 3-colourable implies its dual is bipartite

2 votes
Accepted

Coloring where all colors are present in closed neighborhood of every vertex

2 votes
Accepted

Is the counting version of 1-in-3 Sat #P-complete?

1 vote

Problems that are NP-hard to approximate even when the input graph is regular

1 vote
Accepted

A conjecture on 4-coloring maximal planar graphs

1 vote

Upper Bound for distance-two chromatic number in terms of maximum degree

1 vote
Accepted

Is every 4-colourful Eulerian Orientation of a planar 4-regular graph good?

1 vote

Maximum matching M with the condition G[M] is 2K_2-free

1 vote
Accepted

ETH based lower bound for $k$-COLORING of bounded degree graph

0 votes
Accepted

Does distance-2 coloring fit in Telle and Proskurowski 's algorithm for partial-k trees?