Results 261 to 270 of about 391,866 (285)
Some of the next articles are maybe not open access.
SIAM Journal on Computing, 1999
Plane graphs \(G\) can be represented by floor plans. A floor plan is a rectangle, partitioned into a set of disjoint rectilinear polygonal regions, which are called the modules. Every module presents a vertex, and it is required that two modules share a piece of their borders if and only if the corresponding vertices are adjacent in \(G\). It has been
openaire +1 more source
Plane graphs \(G\) can be represented by floor plans. A floor plan is a rectangle, partitioned into a set of disjoint rectilinear polygonal regions, which are called the modules. Every module presents a vertex, and it is required that two modules share a piece of their borders if and only if the corresponding vertices are adjacent in \(G\). It has been
openaire +1 more source
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
Distinct Classes of Complex Structural Variation Uncovered across Thousands of Cancer Genome Graphs
Cell, 2020Kevin Hadi, Xiaotong Yao, Julie Behr
exaly
Advances and Applications in Discrete Mathematics, 2020
Ashkenazi, Yehuda, Busharyan, Ruth
openaire +1 more source
Ashkenazi, Yehuda, Busharyan, Ruth
openaire +1 more source
Non‐rainbow colorings of 3‐, 4‐ and 5‐connected plane graphs
Journal of Graph Theory, 2010Zdenek Dvorak, Riste Škrekovski
exaly
On the Number of Plane Geometric Graphs
Graphs and Combinatorics, 2007Oswin Aichholzer +2 more
exaly
Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable
SIAM Journal on Discrete Mathematics, 2017Ligang Jin, Yingqian Wang
exaly
Facially-constrained colorings of plane graphs: A survey
Discrete Mathematics, 2017Július Czap, Stanislav Jendrol
exaly