Newbetuts

We call a coloring of $3$-regular graph with $3$ colors good if for every $3$ edges incident with a vertex ...

Four color theorem disproof?

Counting trails in a triangular grid

Proving that the number of vertices of odd degree in any graph G is even

3 Utilities | 3 Houses puzzle?

Euler, Grinberg,... who's next?

A 3-regular graph with at most 2 bridges has 1 factor.

Prove that in a tree with maximum degree $k$, there are at least $k$ leaves

What do the eigenvectors of an adjacency matrix tell us?

How to prove that a simple graph having 11 or more vertices or its complement is not planar?

An optimal non-bipartite matching (Python implementation)

Graph theory software?

Maximally unique beach volleyball games

Is it possible to have a spherical object with only hexagonal faces?

Graph terminology: vertex, node, edge, arc

For which $n\in\Bbb N$ can we divide $\{1,2,3,...,3n\}$ into $n$ subsets each with $3$ elements such that in each subset $\{x,y,z\}$ we have $x+y=3z$?

How can I find the number of the shortest paths between two points on a 2D lattice grid?

New posts in graph-theory

Approach to counting the number of sub-graphs of a given graph $G = (V,E)$

If a graph with $n$ vertices and $n$ edges there must a cycle?

Difference between a sub graph and induced sub graph.

We call a coloring of $3$-regular graph with $3$ colors good if for every $3$ edges incident with a vertex ...

Four color theorem disproof?

Counting trails in a triangular grid

Proving that the number of vertices of odd degree in any graph G is even

3 Utilities | 3 Houses puzzle?

Euler, Grinberg,... who's next?

A 3-regular graph with at most 2 bridges has 1 factor.

Prove that in a tree with maximum degree $k$, there are at least $k$ leaves

What do the eigenvectors of an adjacency matrix tell us?

How to prove that a simple graph having 11 or more vertices or its complement is not planar?

An optimal non-bipartite matching (Python implementation)

Graph theory software?

Maximally unique beach volleyball games

Is it possible to have a spherical object with only hexagonal faces?

Graph terminology: vertex, node, edge, arc

For which $n\in\Bbb N$ can we divide $\{1,2,3,...,3n\}$ into $n$ subsets each with $3$ elements such that in each subset $\{x,y,z\}$ we have $x+y=3z$?

How can I find the number of the shortest paths between two points on a 2D lattice grid?