GATE Overflow for GATE CSE - Recent questions tagged graph-coloring
https://gateoverflow.in/tag/graph-coloring
Powered by Question2AnswerTIFR CSE 2022 | Part B | Question: 12
https://gateoverflow.in/381997/tifr-cse-2022-part-b-question-12
<p>Given an undirected graph $G$, an ordering $\sigma$ of its vertices is called a <em>perfect ordering</em> if for every vertex $v$, the neighbours of $v$ which precede $v$ in $\sigma$ form a clique in $G$.</p>
<p>Recall that given an undirected graph $G$, a <em>clique</em> in $G$ is a subset of vertices every two of which are connected by an edge, while a <em>perfect colouring</em> of $G$ <em>with</em> $k$ colours is an assignment of labels from the set $\{1,2, \ldots, k\}$ to the vertices of $G$ such that no two vertices which are adjacent in $G$ receive the same label.</p>
<p>Consider the following problems.</p>
<p><strong>Problem SPECIAL-CLIQUE</strong></p>
<p><strong>INPUT:</strong> An undirected graph $G$, a positive integer $k$, and a perfect ordering $\sigma$ of the vertices of $G$.</p>
<p><strong>OUTPUT:</strong> Yes, if $G$ has a clique of size at least $k$, No otherwise.</p>
<p><strong>Problem SPECIAL-COLOURING</strong></p>
<p><strong>INPUT:</strong> An undirected graph $G$, a positive integer $k$, and a perfect ordering $\sigma$ of the vertices of $G$.</p>
<p><strong>OUTPUT:</strong> Yes, if $G$ has a proper colouring with at most $k$ colours, No otherwise.</p>
<p>Assume that $\mathrm{P} \neq N P$. Which of the following statements is true?</p>
<ol start="1" style="list-style-type:upper-alpha">
<li>Both SPECIAL-CLIQUE and SPECIAL-COLOURING are undecidable</li>
<li>Only SPECIAL-CLIQUE is in $\mathrm{P}$</li>
<li>Only SPECIAL-COLOURING is in $\mathrm{P}$</li>
<li>Both SPECIAL-CLIQUE and SPECIAL-COLOURING are in $\mathrm{P}$</li>
<li>Neither of SPECIAL-CLiQUE and SPECIAL-COLOURING is in $\mathrm{P},$ but both are decidable</li>
</ol>Graph Theoryhttps://gateoverflow.in/381997/tifr-cse-2022-part-b-question-12Thu, 01 Sep 2022 17:42:48 +0000Best Open Video Playlist for Graph Theory: Coloring Topic | Discrete Mathematics
https://gateoverflow.in/380467/video-playlist-graph-theory-coloring-discrete-mathematics
<p>Please list out the best free available video playlist for <strong>Graph Theory: Coloring </strong>Topic from Discrete Mathematics as an answer here (only one playlist per answer). We'll then select the best playlist and add to <a href="http://classroom.gateoverflow.in" rel="nofollow">GO classroom</a> video lists. You can add any video playlist link including your own (as long as they are free to access) but standard ones are more likely to be selected as best.<br>
<br>
For the full list of selected videos please see <a href="https://docs.google.com/spreadsheets/d/e/2PACX-1vQTEfCg28q1B_buKRxaVvUjN_CTu9UntAiqi9qBiZZesmJE6LnqfkuwxNQOsNcU1g/pubhtml" rel="nofollow">here</a></p>Study Resourceshttps://gateoverflow.in/380467/video-playlist-graph-theory-coloring-discrete-mathematicsSun, 14 Aug 2022 19:26:32 +0000TIFR CSE 2021 | Part B | Question: 13
https://gateoverflow.in/358940/tifr-cse-2021-part-b-question-13
<p>Let $A$ be a $3 \times 6$ matrix with real-valued entries. Matrix $A$ has rank $3$. We construct a graph with $6$ vertices where each vertex represents distinct column in $A$, and there is an edge between two vertices if the two columns represented by the vertices are linearly independent. Which of the following statements $\text{MUST}$ be true of the graph constructed?</p>
<ol style="list-style-type:upper-alpha" type="A">
<li>Each vertex has degree at most $2$.</li>
<li>The graph is connected.</li>
<li>There is a clique of size $3$.</li>
<li>The graph has a cycle of length $4$.</li>
<li>The graph is $3$-colourable.</li>
</ol>Graph Theoryhttps://gateoverflow.in/358940/tifr-cse-2021-part-b-question-13Thu, 25 Mar 2021 09:14:55 +0000TIFR CSE 2021 | Part B | Question: 14
https://gateoverflow.in/358939/tifr-cse-2021-part-b-question-14
<p>Consider the following greedy algorithm for colouring an $n$-vertex undirected graph $G$ with colours $c_{1}, c_{2}, \dots:$ consider the vertices of $G$ in any sequence and assign the chosen vertex the first colour that has not already been assigned to any of its neighbours. Let $m(n, r)$ be the minimum number of edges in a graph that causes this greedy algorithm to use $r$ colours. Which of the following is correct?</p>
<ol style="list-style-type:upper-alpha" type="A">
<li>$m\left ( n, r \right ) = \Theta \left ( r \right )$</li>
<li>$m\left ( n, r \right ) = \Theta \left ( r\left \lceil \log_{2} \:r \right \rceil \right )$</li>
<li>$m\left ( n, r \right ) = \binom{r}{2}$</li>
<li>$m\left ( n, r \right ) = nr$</li>
<li>$m\left ( n, r \right ) = n\binom{r}{2}$</li>
</ol>Graph Theoryhttps://gateoverflow.in/358939/tifr-cse-2021-part-b-question-14Thu, 25 Mar 2021 09:14:54 +0000NIELIT 2017 DEC Scientist B - Section B: 52
https://gateoverflow.in/336261/nielit-2017-dec-scientist-b-section-b-52
<p>Let $G$ be a simple undirected graph on $n=3x$ vertices $(x \geq 1)$ with chromatic number $3$, then maximum number of edges in $G$ is</p>
<ol start="1" style="list-style-type:upper-alpha">
<li>$n(n-1)/2$</li>
<li>$n^{n-2}$</li>
<li>$nx$</li>
<li>$n$</li>
</ol>Graph Theoryhttps://gateoverflow.in/336261/nielit-2017-dec-scientist-b-section-b-52Mon, 30 Mar 2020 08:21:10 +0000UGC NET CSE | January 2017 | Part 2 | Question: 5
https://gateoverflow.in/335158/ugc-net-cse-january-2017-part-2-question-5
<p>Consider a Hamiltonian Graph $G$ with no loops or parallel edges and with $\left | V\left ( G \right ) \right |= n\geq 3$. The which of the following is true?</p>
<ol style="list-style-type:upper-alpha" type="A">
<li>$\text{deg}\left ( v \right )\geq \frac{n}{2}$ for each vertex $v\\$</li>
<li>$\left | E\left ( G \right ) \right |\geq \frac{1}{2}\left ( n-1 \right )\left ( n-2 \right )+2 \\$</li>
<li>$\text{deg}\left ( v \right )+\text{deg}\left ( w \right )\geq n$ whenever $v$ and $w$ are not connected by an edge</li>
<li>All of the above</li>
</ol>Graph Theoryhttps://gateoverflow.in/335158/ugc-net-cse-january-2017-part-2-question-5Tue, 24 Mar 2020 00:08:01 +0000GATE CSE 2020 | Question: 52
https://gateoverflow.in/333179/gate-cse-2020-question-52
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 _______Graph Theoryhttps://gateoverflow.in/333179/gate-cse-2020-question-52Wed, 12 Feb 2020 06:29:49 +0000TIFR CSE 2020 | Part B | Question: 11
https://gateoverflow.in/333132/tifr-cse-2020-part-b-question-11
<p>Which of the following graphs are bipartite?</p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=5522526525957247658" width="680"></p>
<ol start="1" style="list-style-type:upper-alpha">
<li>Only $(1)$</li>
<li>Only $(2)$</li>
<li>Only $(2)$ and $(3)$</li>
<li>None of $(1),(2),(3)$</li>
<li>All of $(1),(2),(3)$</li>
</ol>Graph Theoryhttps://gateoverflow.in/333132/tifr-cse-2020-part-b-question-11Mon, 10 Feb 2020 19:00:21 +0000CMI2019-A-7
https://gateoverflow.in/320547/cmi2019-a-7
<p>An interschool basketball tournament is being held at the Olympic sports complex. There are multiple basketball courts. Matches are scheduled in parallel, with staggered timings, to ensure that spectators always have some match or other available to watch. Each match requires a team of referees and linesmen. Two matches that overlap require disjoint teams of referees and linesmen. The tournament organizers would like to determine how many teams of referees and linesmen they need to mobilize to effectively conduct the tournament. To determine this, which graph theoretic problem do the organizers have to solve?</p>
<ol start="1" style="list-style-type:upper-alpha">
<li>Find a minimal colouring.</li>
<li>Find a minimal spanning tree.</li>
<li>Find a minimal cut.</li>
<li>Find a minimal vertex cover.</li>
</ol>Graph Theoryhttps://gateoverflow.in/320547/cmi2019-a-7Fri, 13 Sep 2019 14:38:39 +0000GATE Overflow | Mock GATE | Test 1 | Question: 51
https://gateoverflow.in/285428/gate-overflow-mock-gate-test-1-question-51
$\begin{array}{|c|c|c|c|c|c|c|} \hline 0 & 1 & 1 & 0 & 1 & 1 & 0 \\ \hline 1 & 0 & 0 & 1 & 1 & 0 & 1 \\ \hline 1& 0 & 0 & 1 & 1 & 1 & 0 \\ \hline 0 & 1 & 1 & 0 & 1 & 0 & 1 \\ \hline 1 & 1 & 1 & 1 & 0 & 0 & 0 \\ \hline 1 & 0 & 1 & 0 & 0 & 0 & 1 \\ \hline 0 & 1 & 0 & 1 & 0 & 1 & 0 \\ \hline \end{array}$<br />
Consider the above given adjacency matrix representation of a graph containing $7$ nodes (namely A , B, C, D, E, F, G). The Chromatic number of the given graph is?Graph Theoryhttps://gateoverflow.in/285428/gate-overflow-mock-gate-test-1-question-51Thu, 27 Dec 2018 17:24:34 +0000Graph Coloring
https://gateoverflow.in/271296/graph-coloring
<p>How many ways are there to color this graph from any $4$ of the following colors : Violet, Indigo, Blue, Green, Yellow, Orange and Red ?<br>
There is a condition that adjacent vertices should not be of the same color<br>
I am getting $1680$. Is it correct?</p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=9164177790851994087"></p>Graph Theoryhttps://gateoverflow.in/271296/graph-coloringTue, 27 Nov 2018 17:28:33 +0000Zeal Test Series 2019: Graph Theory - Graph Coloring
https://gateoverflow.in/267419/zeal-test-series-2019-graph-theory-graph-coloring
<p style="text-align:center"><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=17161260244923189450"></p>
<p>what is index ?</p>Graph Theoryhttps://gateoverflow.in/267419/zeal-test-series-2019-graph-theory-graph-coloringMon, 19 Nov 2018 10:21:07 +0000Regular graph coloring
https://gateoverflow.in/262203/regular-graph-coloring
If G is a connected k-regular graph with chromatic number k+1, then find the number of edges in G?Graph Theoryhttps://gateoverflow.in/262203/regular-graph-coloringTue, 06 Nov 2018 18:24:26 +0000Graph Coloring
https://gateoverflow.in/245308/graph-coloring
<p>A vertex colouring with four colours of a graph <em>G</em> = (<em>V</em>, <em>E</em>) is a mapping <em>V</em> → {<em>R</em>, <em>G</em>, <em>B</em>, <em>Y</em> }. So that any two adjacent vertices does not same colour. Consider the below graphs:</p>
<p><img alt="" height="245" src="https://gateoverflow.in/?qa=blob&qa_blobid=5181733416384095632" width="326"></p>
<p>The number of vertex colouring possible with 4 colours are _________.</p>Graph Theoryhttps://gateoverflow.in/245308/graph-coloringFri, 21 Sep 2018 07:09:11 +0000How to find even or odd cylce in a graph
https://gateoverflow.in/222993/how-to-find-even-or-odd-cylce-in-a-graph
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=16931233543058030232"></p>
<p>Consider this example , There is even vertices cycle as well as odd vertices cycle as per my understanding, let me know if it correct.</p>
<p>Thanks a lot</p>Graph Theoryhttps://gateoverflow.in/222993/how-to-find-even-or-odd-cylce-in-a-graphSat, 30 Jun 2018 06:50:43 +0000Self-Doubt regarding Graph Coloring
https://gateoverflow.in/219836/self-doubt-regarding-graph-coloring
<p>This has reference to the below question</p>
<p><a rel="nofollow" href="https://gateoverflow.in/204092/gate2018-18?show=204092#q204092">https://gateoverflow.in/204092/gate2018-18?show=204092#q204092</a></p>
<p>My doubt is </p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=12541659753166363078"></p>
<p>Suppose, I try to colour the vertices of this graph as follows</p>
<ul>
<li>First I colour vertex a and f with colour 1.</li>
<li>Then I colour vertex e and b with colour 2.</li>
<li>Now when I move to colour vertex c and d, it appears to me now that I need 4 colours.</li>
</ul>
<p>But the chromatic number of this graph is 3.This was the mistake I did in GATE exam.</p>
<p>Please, anyone help me know what is exactly wrong with my approach and how what points in mind do I need to remember so that I can colour any given graph with the minimum number of colours.</p>Graph Theoryhttps://gateoverflow.in/219836/self-doubt-regarding-graph-coloringThu, 07 Jun 2018 14:39:09 +0000GATE CSE 2018 | Question: 18
https://gateoverflow.in/204092/gate-cse-2018-question-18
<p>The chromatic number of the following graph is _____</p>
<p style="text-align:center"><img alt="" height="172" src="https://gateoverflow.in/?qa=blob&qa_blobid=2195086819466505971" width="255"></p>Graph Theoryhttps://gateoverflow.in/204092/gate-cse-2018-question-18Wed, 14 Feb 2018 04:49:41 +0000Graph Coloring
https://gateoverflow.in/198285/graph-coloring
<p>A vertex colouring with four colours of a graph <em>G</em> = (<em>V</em>, <em>E</em>) is a mapping <em>V</em> → {<em>R</em>, <em>G</em>, <em>B</em>, <em>Y</em> }. So that any two adjacent vertices does not same colour. Consider the below graphs:</p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=18418011520117272729"></p>
<p>The number of vertex colouring possible with 4 colours are _________.</p>
<hr>
<p>In the solution, they used the dearragement logic. It is well-known that inner complete graph can be colored in 24 ways but they used dearrangement for outer graph. Like if we assign Red to E then we can color A other than Red and green to G then can color D other than green, through this lets color A with Blue <strong>which is other than Red</strong> and D with also blue <strong>which is other than Green, </strong> now this case is clearly violating graph coloring property. </p>
<p>How, to solve this one?</p>Graph Theoryhttps://gateoverflow.in/198285/graph-coloringMon, 22 Jan 2018 04:40:52 +0000MadeEasy Test Series 2018: Graph Theory - Graph Coloring
https://gateoverflow.in/193302/madeeasy-test-series-2018-graph-theory-graph-coloring
<p>Consider the following graph:</p>
<p> Which of the following will represents the chromatic number of the graph?</p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=8019773362941721220"></p>
<p>answer given is 4.</p>
<p>Please provide a detailed solution.</p>Graph Theoryhttps://gateoverflow.in/193302/madeeasy-test-series-2018-graph-theory-graph-coloringThu, 11 Jan 2018 16:39:06 +0000Graph Colouring
https://gateoverflow.in/192697/graph-colouring
<p>The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same color, is</p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=6380631017865169438"></p>Graph Theoryhttps://gateoverflow.in/192697/graph-colouringWed, 10 Jan 2018 10:47:53 +0000Test Series
https://gateoverflow.in/185072/test-series
<p>Consider the following graph:</p>
<p>Which of the following will represents the chromatic number of the graph?</p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=16841281041166516176"></p>
<p>I think ans has to be 3 but given as 4</p>Graph Theoryhttps://gateoverflow.in/185072/test-seriesSun, 24 Dec 2017 02:39:53 +0000#GRAPH THEORY
https://gateoverflow.in/184776/%23graph-theory
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=14143870846459376101"></p>Graph Theoryhttps://gateoverflow.in/184776/%23graph-theorySat, 23 Dec 2017 08:20:00 +0000TIFR CSE 2018 | Part A | Question: 9
https://gateoverflow.in/179388/tifr-cse-2018-part-a-question-9
<p>How many ways are there to assign colours from range $\left\{1,2,\ldots,r\right\}$ to vertices of the following graph so that adjacent vertices receive distinct colours?</p>
<p style="text-align:center"><img alt="" height="151" src="https://gateoverflow.in/?qa=blob&qa_blobid=15472460607985875761" width="190"></p>
<ol style="list-style-type:upper-alpha">
<li>$r^{4}$</li>
<li>$r^{4} - 4r^{3}$</li>
<li>$r^{4}-5r^{3}+8r^{2}-4r$</li>
<li>$r^{4}-4r^{3}+9r^{2}-3r$</li>
<li>$r^{4}-5r^{3}+10r^{2}-15r$</li>
</ol>Graph Theoryhttps://gateoverflow.in/179388/tifr-cse-2018-part-a-question-9Sun, 10 Dec 2017 06:17:03 +0000#Graph theory #coloring
https://gateoverflow.in/172616/%23graph-theory-%23coloring
How to find number of ways for coloring a graph with 'm' colors for following graphs<br />
<br />
a)connected graph(with no cycles)<br />
<br />
b)regular graphGraph Theoryhttps://gateoverflow.in/172616/%23graph-theory-%23coloringTue, 21 Nov 2017 04:21:22 +0000chromatic number
https://gateoverflow.in/168890/chromatic-number
Let G be a planar Graph Such that every phase is bordered by exactly 3 edges which of the following can never be value for X(G)<br />
<br />
a)2 b)3 C)4 d)none of theseGraph Theoryhttps://gateoverflow.in/168890/chromatic-numberSat, 11 Nov 2017 10:56:00 +0000GRAPH THEORY EDGE COLORING
https://gateoverflow.in/166310/graph-theory-edge-coloring
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=1870949515294565115"></p>Algorithmshttps://gateoverflow.in/166310/graph-theory-edge-coloringSun, 05 Nov 2017 07:15:14 +0000Chromatic polynomials
https://gateoverflow.in/162440/chromatic-polynomials
<p>Check which of the following can be chromatic polynomials of a non-null graph ?</p>
<p>i) x<sup>5</sup> - 4x<sup>3</sup> - 2x<sup>2</sup> + x + 4</p>
<p>ii) x<sup>6</sup> - 3x<sup>5</sup> + 2x<sup>4</sup> - 1</p>
<p>P.S I know for a non-null graph G, X(G) (i.e. chromatic number) is at least 2. How to proceed further ??</p>Mathematical Logichttps://gateoverflow.in/162440/chromatic-polynomialsTue, 24 Oct 2017 09:25:55 +0000Graphs
https://gateoverflow.in/156426/graphs
We know that every 2-colourable graph is bipartite. To prove that we divide the vertices having different colors and put them separately in 2 partitions.<br />
<br />
Suppose there are n vertices in an empty graph and they are randomly colored as 1 and 2. The ones with '1' are placed in partition A and those with '2' are placed in partition B . Can this be called a bipartite case even when there is no connection b/w the vertices of partition A and B? If not, why?Graph Theoryhttps://gateoverflow.in/156426/graphsSat, 30 Sep 2017 14:23:40 +0000Virtual Gate Test Series: Algorithms - Tree Coloring
https://gateoverflow.in/151190/virtual-gate-test-series-algorithms-tree-coloring
Consider a tree with $n$ nodes where a node can be adjacent to max $4$ other nodes what is the minimum number of colors needed to color the tree so that no two adjacent nodes get the same color?Algorithmshttps://gateoverflow.in/151190/virtual-gate-test-series-algorithms-tree-coloringSun, 10 Sep 2017 06:51:58 +0000#Chromatic number , Planarity
https://gateoverflow.in/104130/%23chromatic-number-planarity
Let G be a planar graph such that every face is bordered by exactly 3 edges.Which of the following can never be the value for χ(G) ? (where χ(G) is the chromatic number of G)<br />
<br />
a) 2<br />
<br />
b) 3<br />
<br />
c) 4<br />
<br />
d) None of these<br />
<br />
PS : (Explain: "every face is bordered by exactly 3 edges. ")Graph Theoryhttps://gateoverflow.in/104130/%23chromatic-number-planarityWed, 11 Jan 2017 15:09:19 +0000GateForum Test Series: Graph Theory - Graph Coloring
https://gateoverflow.in/103201/gateforum-test-series-graph-theory-graph-coloring
The Chromatic Number of Cycle Graph with 7 vertices _____Graph Theoryhttps://gateoverflow.in/103201/gateforum-test-series-graph-theory-graph-coloringMon, 09 Jan 2017 14:30:16 +0000TIFR CSE 2016 | Part B | Question: 13
https://gateoverflow.in/98012/tifr-cse-2016-part-b-question-13
<p>An undirected graph $G = (V, E)$ is said to be $k$-colourable if there exists a mapping $c: V \rightarrow \{1, 2, \dots k \}$ such that for every edge $\{u, v\} \in E$ we have $c(u) \neq c(v)$. Which of the following statements is $\text{FALSE}$?</p>
<ol style="list-style-type:upper-alpha">
<li>$G$ is $\mid V \mid $ -colourable</li>
<li>$G$ is $2$-colourable if there are no odd cycles in $G$</li>
<li>$G$ is $(\Delta +1)$-colourable where $\Delta$ is the maximum degree in $G$</li>
<li>There is a polynomial time algorithm to check if $G$ is $2$-colourable</li>
<li>If $G$ has no triangle then it is $3$-colourable</li>
</ol>Graph Theoryhttps://gateoverflow.in/98012/tifr-cse-2016-part-b-question-13Thu, 29 Dec 2016 06:20:59 +0000TIFR CSE 2017 | Part B | Question: 10
https://gateoverflow.in/95817/tifr-cse-2017-part-b-question-10
<p>A vertex colouring of a graph $G=(V, E)$ with $k$ coulours is a mapping $c: V \rightarrow \{1, \dots , k\}$ such that $c(u) \neq c(v)$ for every $(u, v) \in E$. Consider the following statements:</p>
<ol style="list-style-type:lower-roman">
<li>If every vertex in $G$ has degree at most $d$ then $G$ admits a vertex coulouring using $d+1$ colours.</li>
<li>Every cycle admits a vertex colouring using $2$ colours</li>
<li>Every tree admits a vertex colouring using $2$ colours</li>
</ol>
<p>Which of the above statements is/are TRUE? Choose from the following options:</p>
<ol style="list-style-type:upper-alpha">
<li>only i</li>
<li>only i and ii</li>
<li>only i and iii</li>
<li>only ii and iii</li>
<li>i, ii, and iii</li>
</ol>Graph Theoryhttps://gateoverflow.in/95817/tifr-cse-2017-part-b-question-10Fri, 23 Dec 2016 11:47:52 +0000TIFR CSE 2017 | Part B | Question: 1
https://gateoverflow.in/95669/tifr-cse-2017-part-b-question-1
<p>A vertex colouring with three colours of a graph $G=(V, E)$ is a mapping $c: V \rightarrow \{R, G, B\}$ so that adjacent vertices receive distinct colours. Consider the following undirected graph.</p>
<p style="text-align:center"><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=13083293614834542546" width="420"></p>
<p>How many vertex colouring with three colours does this graph have?</p>
<ol style="list-style-type:upper-alpha">
<li>$3^9$</li>
<li>$6^3$</li>
<li>$3 \times 2^8$</li>
<li>$27$</li>
<li>$24$</li>
</ol>Graph Theoryhttps://gateoverflow.in/95669/tifr-cse-2017-part-b-question-1Fri, 23 Dec 2016 06:09:43 +0000Algo-coloring
https://gateoverflow.in/90976/algo-coloring
Consider a tree with n nodes, where a node can be adjacent to maximum 4 other nodes.Then the minimum number of color needed to color the tree, so that no two adjacent node gets same color?Graph Theoryhttps://gateoverflow.in/90976/algo-coloringFri, 09 Dec 2016 06:15:05 +0000