Question

How can we show that 3-dimensional matching $\le_p$ exact cover?

score 1.7k · Answer 1 · 2026-04-16 11:31:05

1.7k

Views

How can we show that 3-dimensional matching $\le_p$ exact cover?

Published on 16 Apr 2026 - 11:31

score 56 · Answer 2 · 2026-04-16 00:55:03

56

Views

Graph proof question

Published on 16 Apr 2026 - 0:55

score 549 · Answer 3 · 2026-04-16 10:59:08

549

Views

Coloring of regular graph's edges

Published on 16 Apr 2026 - 10:59

score 120 · Answer 4 · 2026-04-11 20:09:11

120

Views

trail vs path in Graph Theory v/s Graphical Models

Published on 11 Apr 2026 - 20:09

score 246 · Answer 5 · 2026-04-15 11:02:30

246

Views

Simple Tree Proof

Published on 15 Apr 2026 - 11:02

score 395 · Answer 6 · 2026-04-13 23:34:22

395

Views

Let G and H be simple graphs. Show $k$(GvH)= min {$v$(G)+$k$(H),$v$(H)+$k$(G)}

Published on 13 Apr 2026 - 23:34

score 293 · Answer 7 · 2026-04-16 13:38:00

293

Views

Directed acyclic graph problem

Published on 16 Apr 2026 - 13:38

score 402 · Answer 8 · 2026-04-17 08:21:54

402

Views

Given a planar subdivision $S$, prove that the face of $S$ containing a point $q$ can be computed in linear time

Published on 17 Apr 2026 - 8:21

score 156 · Answer 9 · 2026-04-13 03:49:44

156

Views

How many ways to place 3 non-attacking bishops given the following conditions

Published on 13 Apr 2026 - 3:49

score 887 · Answer 10 · 2026-04-16 02:11:17

Show that if either (a) G is not 2-connected, or , (b) G is bipartite with bipartition (X, Y) where IXI different to lYI, then" G is non hamiltonian.

score 42 · Answer 11 · 2026-04-11 20:24:15

42

Views

Infinite set of graphs neither of which are homeomorphic

Published on 11 Apr 2026 - 20:24

score 1.7k · Answer 12 · 2026-04-14 17:18:53

1.7k

Views

Proof that no Eulerian Tour exists for graph with even number of vertices and odd number of edges

Published on 14 Apr 2026 - 17:18

score 2.3k · Answer 13 · 2026-04-15 05:10:46

2.3k

Views

Simple proof by contradiction in graph theory

Published on 15 Apr 2026 - 5:10

score 3.5k · Answer 14 · 2026-04-12 09:28:10

3.5k

Views

Maximum flow problem with both minimum and maximum capacities

Published on 12 Apr 2026 - 9:28

score 2.8k · Answer 15 · 2026-04-17 15:45:31

2.8k

Views

A cycle in an undirected graph

Published on 17 Apr 2026 - 15:45

List Question

How can we show that 3-dimensional matching $\le_p$ exact cover?

Graph proof question

Coloring of regular graph's edges

trail vs path in Graph Theory v/s Graphical Models

Simple Tree Proof

Let G and H be simple graphs. Show $k$(GvH)= min {$v$(G)+$k$(H),$v$(H)+$k$(G)}

Directed acyclic graph problem

Given a planar subdivision $S$, prove that the face of $S$ containing a point $q$ can be computed in linear time

How many ways to place 3 non-attacking bishops given the following conditions

Show that if either (a) G is not 2-connected, or , (b) G is bipartite with bipartition (X, Y) where IXI different to lYI, then" G is non hamiltonian.

Infinite set of graphs neither of which are homeomorphic

Proof that no Eulerian Tour exists for graph with even number of vertices and odd number of edges

Simple proof by contradiction in graph theory

Maximum flow problem with both minimum and maximum capacities

A cycle in an undirected graph

Trending Questions

Popular # Hahtags

Popular Questions