All Questions
Tagged with eulerian-path coloring
5
questions
1
vote
1
answer
593
views
Difference between chromatic number and minimal vertex covering
I have just started learning graph theory not long ago, this is a past year problem and I got the correct answer by chance(True/False questions), wanted to check my understanding on this site.
My ...
0
votes
0
answers
287
views
Alternating path from any vertex to any vertex [duplicate]
Statement: Given a connected graph with all edges coloured in one of two colours (red and black), so that for each vertex the number of incident red edges is equal to the number of black edges.
Proof:...
1
vote
1
answer
688
views
Connected graph with colored edges
We have connected undirected graph with colored edges in two way (green or blue). And also each vertex have the same number of green and blue edges. How to prove that there are alternate colored (...
- 350
1
vote
2
answers
1k
views
Graph theory, graph coloring, hamilton
A simple graph G has $14$ vertices and $85$ edges.
Show that G must have a Hamilton circuit but
does not have an Euler circuit.
My attempt:
to be hamilton circuit, each should have degree at least $...
- 285
1
vote
1
answer
1k
views
Connected, planar, 3-colorable graph with every face of degree 3 has an Eulerian circuit
I am trying to prove that:
If G is a connected graph where every face has a degree of 3 and is 3 colourable then there exists and Euler tour.
This is what I have done:
For a graph to have an ...
- 11