Results 281 to 290 of about 27,053 (309)
Some of the next articles are maybe not open access.
Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs
Algorithmica, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seok-Hee Hong 0001, Peter Eades
openaire +2 more sources
On the Equitable Edge-Coloring of 1-Planar Graphs and Planar Graphs
Graphs and Combinatorics, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daiqiang Hu +3 more
openaire +2 more sources
Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs
Algorithmica, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seok-Hee Hong 0001, Peter Eades
openaire +1 more source
Generalizations of planar graphs
Networks, 1982AbstractTwo new generalizations of planar graphs, called quasiplanar and pseudoplanar graphs, are introduced and discussed. It is shown that planar graphs are quasiplanar and these in turn are pseudoplanar. Conversely, a pseudoplanar graph that contains with each arc its reverse arc is quasiplanar.
openaire +1 more source
Clique graphs of planar graphs.
Ars Comb., 2004The main result of this paper is a characterization of those \(K_3\)-free or \(K_4\)-free graphs which occur as the clique graphs of planar graphs. Several examples are given of planar graphs which do not occur as clique graphs of planar graphs.
Liliana Alcón, Marisa Gutierrez
openaire +1 more source
Canadian Mathematical Bulletin, 1968
In 1879 Kempe [5] presented what has become the most famous of all incorrect proofs of the Four Colour Conjecture, but even though his proof was erroneous his method has become quite useful. In 1890 Heawood [4] was able to modify Kempe's method to establish the Five Colour Theorem for planar graphs.
openaire +2 more sources
In 1879 Kempe [5] presented what has become the most famous of all incorrect proofs of the Four Colour Conjecture, but even though his proof was erroneous his method has become quite useful. In 1890 Heawood [4] was able to modify Kempe's method to establish the Five Colour Theorem for planar graphs.
openaire +2 more sources
Planarity for clustered graphs
1995In this paper, we introduce a new graph model known as clustered graphs, i.e. graphs with recursive clustering structures. This graph model has many applications in informational and mathematical sciences. In particular, we study C-planarity of clustered graphs.
Qing-Wen Feng +2 more
openaire +1 more source
Formalization of planar graphs
1995Among many fields of mathematics and computer science, discrete mathematics is one of the most difficult fields to formalize because we prove theorems using intuitive inferences that have not been rigorously formalized yet. This paper focuses on graph theory from discrete mathematics and formalizes planar graphs.
Mitsuharu Yamamoto +3 more
openaire +1 more source
Adjacency Labelling for Planar Graphs (and Beyond)
Journal of the ACM, 2021Vida Dujmovic +2 more
exaly
Planar graphs that need four pages
Journal of Combinatorial Theory Series B, 2020Mihalis Yannakakis
exaly