Question

Prove $\chi(G) \le \ell + 1$, where $\ell$ is the length of a longest path in $G$.

score 121 · Answer 1 · 2019-06-20 19:40:27

121

Views

Prove $\chi(G) \le \ell + 1$, where $\ell$ is the length of a longest path in $G$.

Published on 20 Jun 2019 - 19:40

score 759 · Answer 2 · 2026-04-13 01:18:39

759

Views

What are the proper ways to measure the distance between two adjacency matrices of two graphs

Published on 13 Apr 2026 - 1:18

score 402 · Answer 3 · 2026-03-25 14:39:52

402

Views

Outerplanar Graphs with |V| = 2

Published on 25 Mar 2026 - 14:39

score 280 · Answer 4 · 2026-03-26 19:05:44

280

Views

Let $G = (V, E)$ be a weighted graph in which each edge has a positive integer cost $c_e$ and every cost is...

Published on 26 Mar 2026 - 19:05

score 742 · Answer 5 · 2026-04-12 20:25:34

742

Views

Sabidussi Theorem for chromatic number on cartesian product graph

Published on 12 Apr 2026 - 20:25

score 90 · Answer 6 · 2019-06-21 20:55:50

90

Views

Maximum size of a cover in a graph with a greedy algorithm

Published on 21 Jun 2019 - 20:55

score 741 · Answer 7 · 2026-03-25 14:39:08

741

Views

Finding if a subgraph of a minimal non-planar graph is a maximal planar graph

Published on 25 Mar 2026 - 14:39

score 203 · Answer 8 · 2019-06-22 08:48:08

203

Views

A small help needed in proving a smart part of a result - to show that we need at least 2r-3 vertices to construct a particular type of graph.

Published on 22 Jun 2019 - 8:48

score 68 · Answer 9 · 2026-04-12 11:41:21

68

Views

A question on Kruskal's Algorithm

Published on 12 Apr 2026 - 11:41

score 114 · Answer 10 · 2019-06-22 23:58:09

114

Views

Partitions of the complete graph on $n$ vertices.

Published on 22 Jun 2019 - 23:58

score 2.4k · Answer 11 · 2019-06-23 00:18:01

2.4k

Views

Prove that the chromatic index of a $k$-regular graph with a cut vertex is greater than $k$

Published on 23 Jun 2019 - 0:18

score 823 · Answer 12 · 2026-03-25 14:39:54

823

Views

Planar Eulerian graph

Published on 25 Mar 2026 - 14:39

score 193 · Answer 13 · 2026-04-11 23:44:31

193

Views

NP-completeness of chromatic sum in list coloring problem with capacity constraints

Published on 11 Apr 2026 - 23:44

score 1.4k · Answer 14 · 2026-03-26 04:49:31

1.4k

Views

Proving NP-completeness for a problem is a generalization of a known NP-complete problem

Published on 26 Mar 2026 - 4:49

score 50 · Answer 15 · 2019-06-24 04:36:52

50

Views

Given a graph $G$ with proper coloring. There is a vertex $v$ neighbor to all colors.

Published on 24 Jun 2019 - 4:36

List Question

Prove $\chi(G) \le \ell + 1$, where $\ell$ is the length of a longest path in $G$.

What are the proper ways to measure the distance between two adjacency matrices of two graphs

Outerplanar Graphs with |V| = 2

Let $G = (V, E)$ be a weighted graph in which each edge has a positive integer cost $c_e$ and every cost is...

Sabidussi Theorem for chromatic number on cartesian product graph

Maximum size of a cover in a graph with a greedy algorithm

Finding if a subgraph of a minimal non-planar graph is a maximal planar graph

A small help needed in proving a smart part of a result - to show that we need at least 2r-3 vertices to construct a particular type of graph.

A question on Kruskal's Algorithm

Partitions of the complete graph on $n$ vertices.

Prove that the chromatic index of a $k$-regular graph with a cut vertex is greater than $k$

Planar Eulerian graph

NP-completeness of chromatic sum in list coloring problem with capacity constraints

Proving NP-completeness for a problem is a generalization of a known NP-complete problem

Given a graph $G$ with proper coloring. There is a vertex $v$ neighbor to all colors.

Trending Questions

Popular # Hahtags

Popular Questions