user avatar
user avatar
user avatar
Jernej
  • Member for 11 years, 8 months
  • Last seen more than a month ago
  • Slovenia
13 votes

Are all $4$-regular graphs Hamiltonian

11 votes
Accepted

Chromatic polynomial of a grid graph

7 votes

isomorphic planar graph with its complement

6 votes

Chromatic Number and Average degree

5 votes
Accepted

Finding graphs with a given number of spanning trees

5 votes
Accepted

Even bi-coloring of regular graphs

5 votes

Graph Isomorphism for non-mathematician

4 votes
Accepted

How to find the number of spanning trees for a cube?

4 votes
Accepted

Best known bounds for Ramsey numbers

4 votes

Calculate the average distance over all pairs of nodes in a graph

4 votes

What is the maximum number of edges in a planar bipartite graph which have partitions of order 7 and 15?

4 votes

Chromatic Number Identity Involving Edges

4 votes

Computing all spanning trees of an undirected, regular grid (lattice)

3 votes

Determine if subgraph and exhibit if so

3 votes
Accepted

Is this graph $G$ 2-connected and non-hamiltonian? Does Fleischner's theorem apply to $G^2$?

3 votes

diameter and radius of a regular graph

3 votes

Dihedral Groups...

3 votes

What are $r(\Lambda)$ and $s(\Lambda)$?

3 votes
Accepted

Eigenvalues of the distance-k graph of a graph

3 votes
Accepted

Graph Theory Software with simple GUI

2 votes

Adding an edge and a vertex to non-isomorphic graphs

2 votes

example of graph such that deleting any edge couses lack of automorphism

2 votes
Accepted

$2$-connected graphs with a line graph containing no hamilton cycle

2 votes
Accepted

Upper bound for the number of hamilton cycles in a cubic graph

2 votes
Accepted

Prove that for every connected graph $G$ of order $n$ and diameter $d$ , $\chi(G)\leq n-d+1$

2 votes

Graph Theory : Strongly regular graph

2 votes

Looking for algorithms capable of modifying graph structure

2 votes
Accepted

Difference between trivial component and isolated vertex

2 votes
Accepted

A triangle-free, 6-chromatic graph with 44 vertices

2 votes

Is it possible to exist non-isomorphic (k,l) Ramsey graph?