User Nathann Cohen

5 votes

Number of linear orderings of a set to have balanced frequencies of triple orders

answered Oct 1, 2016 at 11:03

2 votes

In what types of graphs can the maximum independent set be found in polynomial time?

answered Dec 27, 2015 at 18:56

4 votes

Minimum size of the union of sets

answered Aug 22, 2015 at 14:52

5 votes

Request for examples of 4-regular, non-planar, girth at least 5 graphs

answered Apr 10, 2015 at 10:13

7 votes

Combinatorial designs textbook recommendation

answered Feb 24, 2015 at 8:15

1 vote

Petersen 2-factor decomposition theorem for directed graphs

answered Nov 16, 2014 at 13:35

2 votes

Bipartite graph

answered Jun 18, 2014 at 10:31

1 vote

A strengthening of Frankl's union-closed conjecture?

answered Apr 7, 2014 at 11:09

1 vote

Almost disjoint set (finite case)

answered Mar 17, 2014 at 13:23

3 votes

Building graphs as unions of disjoint edges

answered Nov 12, 2013 at 16:07

1 vote

Accepted

Uniformly random planar map

answered Sep 18, 2012 at 17:54

0 votes

Minimum covering in cubic graphs

answered May 29, 2012 at 7:07

0 votes

"Face cover" of a planar graph

answered May 29, 2012 at 6:22

4 votes

Accepted

Consistency of systems of inequalities involving only differences

answered Mar 29, 2012 at 10:08

14 votes

Constructing Steiner Triple Systems Algorithmically

answered Aug 4, 2011 at 14:52

3 votes

Degree Sequences and Graph Enumeration

answered Jul 17, 2011 at 15:44

4 votes

Induced Subgraphs and Orbits of the automorphism group action

answered Jul 16, 2011 at 12:14

1 vote

regular graph, edge assignment

answered Jul 13, 2011 at 20:54

4 votes

Accepted

Cycle of length 4 in an undirected graph

answered Jun 16, 2011 at 16:23

4 votes

Cycle of length 4 in an undirected graph

answered Jun 16, 2011 at 16:18

4 votes

Find Graph Cut such that Graph becomes a DAG and Edge Weights are Minimized

answered Apr 30, 2011 at 16:04

4 votes

when does a regular graph have a 1-factorization?

answered Apr 28, 2011 at 13:43

-1 votes

Is it possible to check a graph for acyclicity in $O(|V|)$ time?

answered Apr 16, 2011 at 8:18

4 votes

What packages for subgraph enumeration are available?

answered Jan 17, 2011 at 16:04

3 votes

Example of: K-regular graph with girth K, for a given K

answered Nov 28, 2010 at 9:14

4 votes

How do researchers carry out computational experiments in Graph Theory?

answered Sep 24, 2010 at 19:36

10 votes

A conjectured criterion for 4-colorable graphs

answered Sep 19, 2010 at 23:18

7 votes

What is this operation on graphs called?

answered Sep 17, 2010 at 11:05

5 votes

Accepted

Ref request: A graph G contains H as a minor iff it contains one of finitely many graphs as a topological minor

answered Aug 30, 2010 at 6:32

0 votes

Combining DAGs into an acyclic tournament

answered Aug 19, 2010 at 8:46

Stack Exchange Network

34 Answers

Number of linear orderings of a set to have balanced frequencies of triple orders

In what types of graphs can the maximum independent set be found in polynomial time?

Minimum size of the union of sets

Request for examples of 4-regular, non-planar, girth at least 5 graphs

Combinatorial designs textbook recommendation

Petersen 2-factor decomposition theorem for directed graphs

Bipartite graph

A strengthening of Frankl's union-closed conjecture?

Almost disjoint set (finite case)

Building graphs as unions of disjoint edges

Uniformly random planar map

Minimum covering in cubic graphs

"Face cover" of a planar graph

Consistency of systems of inequalities involving only differences

Constructing Steiner Triple Systems Algorithmically

Degree Sequences and Graph Enumeration

Induced Subgraphs and Orbits of the automorphism group action

regular graph, edge assignment

Cycle of length 4 in an undirected graph

Cycle of length 4 in an undirected graph

Find Graph Cut such that Graph becomes a DAG and Edge Weights are Minimized

when does a regular graph have a 1-factorization?

Is it possible to check a graph for acyclicity in $O(|V|)$ time?

What packages for subgraph enumeration are available?

Example of: K-regular graph with girth K, for a given K

How do researchers carry out computational experiments in Graph Theory?

A conjectured criterion for 4-colorable graphs

What is this operation on graphs called?

Ref request: A graph G contains H as a minor iff it contains one of finitely many graphs as a topological minor

Combining DAGs into an acyclic tournament