✦ LIBER ✦

Planarity and Edge Poset Dimension

✍ Scribed by Hubert de Fraysseix; Patrice Ossona de Mendez

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 291 KB
Volume: 17
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1996.0064

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Posets and planar graphs

✍ Stefan Felsner; William T. Trotter 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

## Abstract Usually __dimension__ should be an integer valued parameter. We introduce a refined version of dimension for graphs, which can assume a value [__t__ − 1 ↕ __t__], thought to be between __t__ − 1 and __t__. We have the following two results: (a) a graph is outerplanar if and only if its

Hopf Algebras and Edge-Labeled Posets

✍ Nantel Bergeron; Frank Sottile 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 440 KB

Given a finite graded poset with labeled Hasse diagram, we construct a quasisymmetric generating function for chains whose labels have fixed descents. This is a common generalization of a generating function for the flag f-vector defined by Ehrenborg and of a symmetric function associated with certa

A Characteristic Property of Labelings a

A Characteristic Property of Labelings and Linear Extensions of Posets of Dimension 2

✍ Marilena Barnabei; Flavio Bonetti; Roberto Pirastu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 98 KB

Edges and Kuratowski Subgraphs of Non-Pl

Edges and Kuratowski Subgraphs of Non-Planar Graphs

✍ Jozef Širáň 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB

It is proved that any edge of a Pconnected non-planar graph G of order a t least 6 lies in a subdivision of K3,3 in G. For any 3-connected non-planar graph G of order a t least 6 we show that G contains at most four edges which belong to no subdivisions of K3,3 in G.

On light edges and triangles in projecti

On light edges and triangles in projective planar graphs

✍ Sanders, Daniel P. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 376 KB 👁 2 views

An edge or face of an embedded graph is light if the sum of the degrees of the vertices incident with it is small. This paper parallelizes four inequalities on the number of light edges and light triangles from the plane to the projective plane. Each of the four inequalities is shown to be the best

Edge-partitions of planar graphs and the

Edge-partitions of planar graphs and their game coloring numbers

✍ Wenjie He; Xiaoling Hou; Ko-Wei Lih; Jiating Shao; Weifan Wang; Xuding Zhu 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 98 KB 👁 1 views

Let G be a planar graph and let g(G) and Á(G) be its girth and maximum degree, respectively. We show that G has an edge-partition into a forest and a subgraph H so that (i) -cycles (though it may contain 3-cycles). These results are applied to find the following upper bounds for the game coloring n