Results 301 to 305 of about 568,500 (305)
Some of the next articles are maybe not open access.
1992
Planar graphs have many important applications in computer science, for example in VLSI layout. Many problems that are hard or even NP-complete for arbitrary graphs are much easier for planar graphs. In the next lecture we will prove a nice result due to Lipton and Tarjan in 1977 [73] which opens up planar graphs to divide-and-conquer.
openaire +1 more source
Planar graphs have many important applications in computer science, for example in VLSI layout. Many problems that are hard or even NP-complete for arbitrary graphs are much easier for planar graphs. In the next lecture we will prove a nice result due to Lipton and Tarjan in 1977 [73] which opens up planar graphs to divide-and-conquer.
openaire +1 more source
On 3-colorings of Plane Graphs
Acta Mathematicae Applicatae Sinica, English Series, 2004The main result of the paper states that any \(3\)-colouring of the vertices of a face of degree at least \(11\) in a planar graph \(G\) without cycles of length \(4\), \(5\) and \(7\) and with no pair of intersecting triangles (i.e. every two 3-cycles of \(G\) are vertex-disjoint) can be extended to a \(3\)-colouring of the whole graph \(G\).
openaire +1 more source
Advances and Applications in Discrete Mathematics, 2020
Ashkenazi, Yehuda, Busharyan, Ruth
openaire +1 more source
Ashkenazi, Yehuda, Busharyan, Ruth
openaire +1 more source