Newbetuts
.
New posts in graph-theory
Chromatic polynomial properties
linear-algebra
graph-theory
Returning Paths on Cubic Graphs
graph-theory
random-walk
What's special about 323 and squared rectangles?
number-theory
graph-theory
recreational-mathematics
integers
tiling
Prove that a tree with a vertex $v$ of degree $k > 1$ has at least $k$ leaves
proof-verification
graph-theory
trees
Difference between k-coloring and k-colorable?
combinatorics
graph-theory
coloring
How to approach this discrete graph question about Trees.
discrete-mathematics
graph-theory
trees
If $G$ is simple with $n$ vertices, doesn't have a triangle and the minimum degree is greater than $\frac{2n}{5}$, then $G$ is bipartite.
graph-theory
bipartite-graphs
extremal-graph-theory
Two seemingly unrelated puzzles have very similar solutions; what's the connection?
group-theory
graph-theory
puzzle
How can we formalise the notion of the face of a planar graph?
graph-theory
definition
planar-graphs
Let $n \ge 9$. How many trees are there on vertex set $[n]$ such that at least one vertex has degree $n-3$?
combinatorics
graph-theory
trees
The Expectation and Variance of the number of $k$ size sets containing exactly $m$ edges in $G(n, p)$
probability-theory
graph-theory
random-graphs
How many disconnected graphs of the Rubik's cube exist?
combinatorics
graph-theory
recreational-mathematics
rubiks-cube
Rank of a graph matrix
linear-algebra
matrices
graph-theory
computer-science
Maximally dense Unit Distance Graphs
combinatorics
graph-theory
extremal-combinatorics
tiling
Spielman's proof of graph connectivity
linear-algebra
graph-theory
eigenvalues-eigenvectors
spectral-graph-theory
How can I find the minimum cut on a graph using a maximum flow algorithm?
graph-theory
cut
minimum
flow
max-flow
Show that triangle-free planar graphs are four-colorable
combinatorics
graph-theory
3-regular connected planar graph
graph-theory
planar-graphs
Sample Directed Graph and Topological Sort Code [closed]
java
algorithm
data-structures
graph-theory
Question about the proof that 'A graph with maximum degree at most k is (k + 1) colorable
graph-theory
coloring
Prev
Next