Skip to main content
vidyarthi's user avatar
vidyarthi's user avatar
vidyarthi's user avatar
vidyarthi
  • Member for 8 years, 1 month
  • Last seen this week
1 vote
0 answers
148 views

The chromatic polynomial of a line graph

1 vote
0 answers
118 views

If choosability of complement is known, can the choosability of the graph be known?

1 vote
0 answers
108 views

Kernel perfect orientations of complete graphs

1 vote
1 answer
136 views

Bound on the chromatic number of square of bipartite graphs

0 votes
1 answer
157 views

Decomposition of regular graphs

0 votes
0 answers
116 views

Procedure to color the edges of a circulant graph

0 votes
0 answers
87 views

Maximum number of tuples from $n$ numbers such that no pair is repeated [duplicate]

0 votes
1 answer
114 views

Recognition of a graph as a product of its quotients

0 votes
0 answers
67 views

Singular values and the chromatic number

0 votes
0 answers
60 views

The order of minor in the total graph of a graph

0 votes
1 answer
123 views

Recognizing perfect Cayley graphs as tensor products

0 votes
1 answer
147 views

Complexity of edge coloring of class 1 graphs

0 votes
0 answers
56 views

Are total graph of power of cycles homeomorphic to powers of cycles?

0 votes
1 answer
109 views

Uniformity in colorings of a graph

0 votes
0 answers
80 views

Coloring a graph formed by cliques sharing at most one point

0 votes
1 answer
141 views

All even order graphs with $\Delta\ge\frac{n}{2}$ is Class 1

0 votes
0 answers
54 views

Do all induced subgraphs of powers of cycles have a perfect matching

0 votes
1 answer
233 views

Highly asymmetric regular graph

0 votes
1 answer
358 views

A vertex transitive graph has a near perfect/ matching missing an independent set of vertices

0 votes
0 answers
50 views

A weakened form of list coloring

0 votes
1 answer
150 views

Combining three matchings to form a maximal matching

0 votes
1 answer
96 views

If the core of a graph is a forest, then it is Class 1

0 votes
0 answers
82 views

Proving Vizing's and Brooks' theorem using the polynomial approach

0 votes
0 answers
559 views

Chromatic polynomial of a bipartite graph replaced by a new graph

0 votes
1 answer
148 views

Chromatic Polynomial when two disjoint graphs are joined at $2$ distinct points [closed]

0 votes
0 answers
53 views

Determining homomorphism using automorphism group of two graphs

0 votes
0 answers
65 views

Cycles in Kneser graphs with three vertices forming triangles

0 votes
0 answers
62 views

Clique sizes of generalized Kneser graphs

0 votes
1 answer
81 views

Line graphs of complete hypergraphs as complement of Kneser graphs

0 votes
0 answers
110 views

Bound on the number of maximum matchings in a graph