Question

What is the chromatic index of a complete graph with its edges doubled?

score 504 · Answer 1 · 2026-04-16 08:48:11

504

Views

What is the chromatic index of a complete graph with its edges doubled?

Published on 16 Apr 2026 - 8:48

score 233 · Answer 2 · 2026-04-15 22:54:17

233

Views

Graph problem...

Published on 15 Apr 2026 - 22:54

score 260 · Answer 3 · 2026-04-11 08:33:32

260

Views

Investigating properties of complements of paths

Published on 11 Apr 2026 - 8:33

score 8.2k · Answer 4 · 2026-04-17 15:58:21

8.2k

Views

Prove $\chi(G)\chi(\bar{G}) \geq n$ for chromatic number of graph and its complement

Published on 17 Apr 2026 - 15:58

score 293 · Answer 5 · 2026-04-13 07:01:35

293

Views

Determine the formula for the toughness of a tree

Published on 13 Apr 2026 - 7:01

score 564 · Answer 6 · 2026-04-17 10:17:03

564

Views

Determine all connected graph $G$ such that subdivision graph $S(G)$ is Hamiltonian

Published on 17 Apr 2026 - 10:17

score 277 · Answer 7 · 2026-04-14 20:05:33

277

Views

Smallest non-isomorphic graphs with the same characteristic polynomials of their laplacian matrices

Published on 14 Apr 2026 - 20:05

score 164 · Answer 8 · 2026-04-16 10:34:40

164

Views

Paper claiming a graph isomorphism that isn't actually an isomorphism?

Published on 16 Apr 2026 - 10:34

score 30 · Answer 9 · 2026-04-14 02:45:34

Connecting nodes under certain conditions and trying to find the correct sequence on OEIS to describe the situation.

score 216 · Answer 10 · 2026-04-11 13:03:32

216

Views

Spanning tree with infinitely many chords.

Published on 11 Apr 2026 - 13:03

score 173 · Answer 11 · 2026-04-16 04:11:26

Show that if $G$ is a connected graph of order $n≥2$ and $k$ is an integer with $1≤k≤n-1$, then $G^k$ is $k$-connected.

score 1.3k · Answer 12 · 2026-04-15 12:39:06

1.3k

Views

Determine a formula for the number of triangles in the line graph $L(G)$ in term of quantities in $G$

Published on 15 Apr 2026 - 12:39

score 16.6k · Answer 13 · 2026-04-15 23:20:09

16.6k

Views

Suppose that every vertex of $G$ has degree at least 3. Prove that $G$ has a cycle of even length.

Published on 15 Apr 2026 - 23:20

score 913 · Answer 14 · 2026-04-14 17:05:32

913

Views

If $G$ is bipartite and does not have $K_{3,3}$ as a topological minor, then $G$ is planar.

Published on 14 Apr 2026 - 17:05

score 246 · Answer 15 · 2026-04-17 00:03:02

246

Views

Is there a problem more difficult than NP-complete in graph theory?

Published on 17 Apr 2026 - 0:03

List Question

What is the chromatic index of a complete graph with its edges doubled?

Graph problem...

Investigating properties of complements of paths

Prove $\chi(G)\chi(\bar{G}) \geq n$ for chromatic number of graph and its complement

Determine the formula for the toughness of a tree

Determine all connected graph $G$ such that subdivision graph $S(G)$ is Hamiltonian

Smallest non-isomorphic graphs with the same characteristic polynomials of their laplacian matrices

Paper claiming a graph isomorphism that isn't actually an isomorphism?

Connecting nodes under certain conditions and trying to find the correct sequence on OEIS to describe the situation.

Spanning tree with infinitely many chords.

Show that if $G$ is a connected graph of order $n≥2$ and $k$ is an integer with $1≤k≤n-1$, then $G^k$ is $k$-connected.

Determine a formula for the number of triangles in the line graph $L(G)$ in term of quantities in $G$

Suppose that every vertex of $G$ has degree at least 3. Prove that $G$ has a cycle of even length.

If $G$ is bipartite and does not have $K_{3,3}$ as a topological minor, then $G$ is planar.

Is there a problem more difficult than NP-complete in graph theory?

Trending Questions

Popular # Hahtags

Popular Questions