EuDML | Browse

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Subjects
05-XX Combinatorics
05Cxx Graph theory
05C10 Planar graphs; geometric and topological aspects of graph theory

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 10 of 10

Independence complexes and edge covering complexes via Alexander duality.

Kawamura, Kazuhiro (2011)

The Electronic Journal of Combinatorics [electronic only]

Independent face and vertex covers in plane graphs

Maciej M. Sysło (1989)

Banach Center Publications

Inductio ad absurdum?

D. R. Woodall (1976)

Pokroky matematiky, fyziky a astronomie

Infinitely many hypermaps of a given type and genus.

Jones, Gareth A., Pinto, Daniel (2010)

The Electronic Journal of Combinatorics [electronic only]

Intersections of Curve Systems and the Crossing Number of C5 x C5 .

C. Thomassen, R.B. Richter (1995)

Discrete & computational geometry

Interval edge-coloring of caterpillars with hairs of arbitrary length

M. Kubale (1987)

Applicationes Mathematicae

Intrinsic knotting and linking of complete graphs.

Flapan, Erica (2002)

Algebraic & Geometric Topology

Intrinsic linking and knotting are arbitrarily complex

Erica Flapan, Blake Mellor, Ramin Naimi (2008)

Fundamenta Mathematicae

We show that, given any n and α, any embedding of any sufficiently large complete graph in ℝ³ contains an oriented link with components Q₁, ..., Qₙ such that for every i ≠ j, $| l k (Q_{i}, Q_{j}) | \geq α$ and $| a ₂ (Q_{i}) | \geq α$ , where $a ₂ (Q_{i})$ denotes the second coefficient of the Conway polynomial of $Q_{i}$ .

Intrinsically linked graphs and even linking number.

Fleming, Thomas, Diesl, Alexander (2005)

Algebraic & Geometric Topology

Isomorphisms of polar and polarized graphs

Bohdan Zelinka (1976)

Czechoslovak Mathematical Journal

Currently displaying 1 – 10 of 10

Page 1