Question

Path in graphs and digraphs

score 127 · Answer 1 · 2018-04-05 12:24:38

127

Views

Path in graphs and digraphs

Published on 05 Apr 2018 - 12:24

score 80 · Answer 2 · 2018-04-05 17:51:11

80

Views

Bondy-Boppana-Siegel: question on notation

Published on 05 Apr 2018 - 17:51

score 30 · Answer 3 · 2018-04-05 19:32:45

30

Views

Removing $4K_3s$ from $K_6$ leaves no other $K_3$

Published on 05 Apr 2018 - 19:32

score 114 · Answer 4 · 2018-04-05 22:32:12

114

Views

Why can't a 9 vertex graph whose complement is in 3 components be planar?

Published on 05 Apr 2018 - 22:32

score 188 · Answer 5 · 2018-04-06 00:50:38

188

Views

Graph theory Combination problem

Published on 06 Apr 2018 - 0:50

score 30 · Answer 6 · 2018-04-06 01:38:06

30

Views

Network consensus in discrete time

Published on 06 Apr 2018 - 1:38

score 461 · Answer 7 · 2026-03-25 20:35:21

461

Views

Partition Adjacency Matrix of Graph into Non-Overlapping Triangles

Published on 25 Mar 2026 - 20:35

score 112 · Answer 8 · 2026-03-25 14:23:10

112

Views

factorisations of vertex transitive graphs

Published on 25 Mar 2026 - 14:23

score 94 · Answer 9 · 2018-04-06 15:39:20

94

Views

Categorizing the class of graphs consisting of the disjoint union of a star with isolated points

Published on 06 Apr 2018 - 15:39

score 525 · Answer 10 · 2026-03-27 07:47:25

525

Views

This is about modification in Dijkstra's algorithm

Published on 27 Mar 2026 - 7:47

score 581 · Answer 11 · 2026-03-25 16:01:06

581

Views

For any graph, is there a topological space where it can be drawn/embedded?

Published on 25 Mar 2026 - 16:01

score 34 · Answer 12 · 2026-03-25 07:45:59

34

Views

Show that the number of edges of $G$ is at least $m\mu$

Published on 25 Mar 2026 - 7:45

score 41 · Answer 13 · 2018-04-06 23:10:21

41

Views

What is fastest (multithreaded?) way to identify which columns in a matrix are "connected"?

Published on 06 Apr 2018 - 23:10

score 87 · Answer 14 · 2026-03-25 17:26:09

87

Views

Mathematical induction proof that each tree has $k = m − 1$ edges

Published on 25 Mar 2026 - 17:26

score 161 · Answer 15 · 2018-04-07 15:29:13

161

Views

How do you prove that any two minimum spanning trees T1 and T2 have a non-empty intersection?

Published on 07 Apr 2018 - 15:29

List Question

Path in graphs and digraphs

Bondy-Boppana-Siegel: question on notation

Removing $4K_3s$ from $K_6$ leaves no other $K_3$

Why can't a 9 vertex graph whose complement is in 3 components be planar?

Graph theory Combination problem

Network consensus in discrete time

Partition Adjacency Matrix of Graph into Non-Overlapping Triangles

factorisations of vertex transitive graphs

Categorizing the class of graphs consisting of the disjoint union of a star with isolated points

This is about modification in Dijkstra's algorithm

For any graph, is there a topological space where it can be drawn/embedded?

Show that the number of edges of $G$ is at least $m\mu$

What is fastest (multithreaded?) way to identify which columns in a matrix are "connected"?

Mathematical induction proof that each tree has $k = m − 1$ edges

How do you prove that any two minimum spanning trees T1 and T2 have a non-empty intersection?

Trending Questions

Popular # Hahtags

Popular Questions