Question

Why doesn't Tutte polynomial T(1,1) equal 0?

score 114 · Answer 1 · 2026-04-17 12:43:49

114

Views

Why doesn't Tutte polynomial T(1,1) equal 0?

Published on 17 Apr 2026 - 12:43

score 2.5k · Answer 2 · 2026-05-11 05:29:06

2.5k

Views

Proof NP-Complete for $L = \{G, T \mid G \text{ is a graph with a spanning tree isomorphic to } T\}$

Published on 11 May 2026 - 5:29

score 433 · Answer 3 · 2026-04-15 21:51:21

433

Views

Expectation of number of links to N selected nodes in a network

Published on 15 Apr 2026 - 21:51

score 339 · Answer 4 · 2026-04-16 02:19:33

339

Views

Simple connected bipartile graph $G=(V,E)$ with $10$ vertices of degree 3 cannot be a planar graph

Published on 16 Apr 2026 - 2:19

score 894 · Answer 5 · 2026-04-15 17:07:44

894

Views

In how many ways you can represent a graph ( data type )?

Published on 15 Apr 2026 - 17:07

score 4.7k · Answer 6 · 2026-04-14 02:11:14

4.7k

Views

Perfect matching in k-cubes

Published on 14 Apr 2026 - 2:11

score 177 · Answer 7 · 2026-04-13 17:39:44

177

Views

Relation between independence number and channel capacity

Published on 13 Apr 2026 - 17:39

score 536 · Answer 8 · 2026-04-15 18:27:48

536

Views

Longest Path in a acyclic, directed graph

Published on 15 Apr 2026 - 18:27

score 560 · Answer 9 · 2026-04-14 13:12:25

560

Views

Determine the number of loops

Published on 14 Apr 2026 - 13:12

score 878 · Answer 10 · 2026-04-13 21:35:05

878

Views

Can deleting an edge from a graph create a single subgraph?

Published on 13 Apr 2026 - 21:35

score 99 · Answer 11 · 2026-04-15 19:57:38

99

Views

Tool for construction of graph with specified properties

Published on 15 Apr 2026 - 19:57

score 969 · Answer 12 · 2026-04-14 18:58:14

969

Views

Can a planar graph be drawn with all vertices on a straight line?

Published on 14 Apr 2026 - 18:58

score 79 · Answer 13 · 2026-04-15 02:31:41

79

Views

Proof with chromatic index.

Published on 15 Apr 2026 - 2:31

score 2.4k · Answer 14 · 2026-04-15 18:13:37

2.4k

Views

Proving every planar graph have vertex cover of size of at most 3n/4

Published on 15 Apr 2026 - 18:13

score 292 · Answer 15 · 2026-04-16 09:54:24

292

Views

Proof that there exists complete matching.

Published on 16 Apr 2026 - 9:54

List Question

Why doesn't Tutte polynomial T(1,1) equal 0?

Proof NP-Complete for $L = \{G, T \mid G \text{ is a graph with a spanning tree isomorphic to } T\}$

Expectation of number of links to N selected nodes in a network

Simple connected bipartile graph $G=(V,E)$ with $10$ vertices of degree 3 cannot be a planar graph

In how many ways you can represent a graph ( data type )?

Perfect matching in k-cubes

Relation between independence number and channel capacity

Longest Path in a acyclic, directed graph

Determine the number of loops

Can deleting an edge from a graph create a single subgraph?

Tool for construction of graph with specified properties

Can a planar graph be drawn with all vertices on a straight line?

Proof with chromatic index.

Proving every planar graph have vertex cover of size of at most 3n/4

Proof that there exists complete matching.

Trending Questions

Popular # Hahtags

Popular Questions