Skip to content
Early access — you're among the first to try PYQLabs. Share feedback
Concept drill

vizing's theorem

GATE CSE & IT · Graph Theory · 2020-2020

1
PYQs
0%
keyed
0
elite explanations
1
years appeared

Study anchor

Rosen — Discrete Mathematics and Its Applications

Discrete structures, counting, relations, graph theory

Practice action

Start latest PYQ

PYQs in this concept

All concepts →
2020 PYQ

Graph G is obtained by adding vertex s to K 3,4 and making s adjacent to every vertex of K 3,4 . The minimum number of colours required to edge-colour G is _____.

mediumbasic explanation