Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightThe minimum number of colors needed to color a graph having n (>3) ver...

The minimum number of colors needed to color a graph having n (>3) ver...

  • Q. The minimum number of colors needed to color a graph having n (>3) vertices and 2 edges is
  • filter_dramaExplanation
    Answer is : B
    None.

Discussion

    No one started the discussion yet. Break the ice and start the conversation.
    Please Login to be part of the discussion.

Similar Questions

  • 1. In a Binary Decision Diagrams 0 values by a _________ line and the 1 values are represented by a _________ line.
  • filter_dramaExplanation
    Answer is : C
    None.
  • 2. If a Graph Structured Stack contains {1,2,3,4} {1,5,3,4} {1,6,7,4} and {8,9,7,4}, what would be the source and sink vertices of the DAC?
  • filter_dramaExplanation
    Answer is : C
    None.
  • 3. The graph colouring algorithm
  • filter_dramaExplanation
    Answer is : D
    None.
  • 4. A
  • filter_dramaExplanation
    Answer is : C
    None.
  • 5. For some sparse graph an adjacency list is more space efficient against an adjacency matrix.
  • filter_dramaExplanation
    Answer is : A
    None.

Data StructureTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points