List questions from graph-theory

Published on 25 Mar 2026 - 3:02

71

Views

Partitions of the set of vertices of a directed graph

Published on 25 Mar 2026 - 16:03

429

Views

Unique matching in a bipartite graph

Published on 01 Apr 2026 - 10:16

178

Views

HP, HC, NP-hard

Published on 28 Jan 2019 - 10:28

60

Views

Can all vertex-transitive graphs be coloured and directed to make Cayley diagrams for groups?

Published on 28 Jan 2019 - 12:51

682

Views

How can I show that there will be at most $4^{n+1}$ pairwise non-isomorphic trees on $n+1$ vertices?

Published on 26 Mar 2026 - 4:53

213

Views

Relation between eigenvectors and powers of a matrix for finding out if a graph is disconnected

Published on 25 Mar 2026 - 13:55

47

Views

Understanding an expression which related to full binary trees

Published on 01 Apr 2026 - 19:12

114

Views

Edge colouring of regular vertex-transitive graphs

Published on 29 Jan 2019 - 0:55

1.2k

Views

Perfect matchings in bipartite graphs.

Published on 25 Mar 2026 - 7:41

28

Views

let H be minor of a graph G. Is it always true that embedding surface of H is less than embedding surface of G

Published on 25 Mar 2026 - 9:49

291

Views

Magic labeling of the octahedron graph

Published on 29 Jan 2019 - 14:53

37

Views

Connectivity(Graph Theory).

Published on 29 Jan 2019 - 16:03

278

Views

Is the converse true?

Published on 31 Mar 2026 - 20:37

77

Views

Naturally induced type in flag algebras

Published on 29 Jan 2019 - 21:10

List Question

Algorithm for optimal assignment of tasks to a team of people

Partitions of the set of vertices of a directed graph

Unique matching in a bipartite graph

HP, HC, NP-hard

Can all vertex-transitive graphs be coloured and directed to make Cayley diagrams for groups?

How can I show that there will be at most $4^{n+1}$ pairwise non-isomorphic trees on $n+1$ vertices?

Relation between eigenvectors and powers of a matrix for finding out if a graph is disconnected

Understanding an expression which related to full binary trees

Edge colouring of regular vertex-transitive graphs

Perfect matchings in bipartite graphs.

let H be minor of a graph G. Is it always true that embedding surface of H is less than embedding surface of G

Magic labeling of the octahedron graph

Connectivity(Graph Theory).

Is the converse true?

Naturally induced type in flag algebras

Trending Questions

Popular # Hahtags

Popular Questions