Planar embeddability of the vertices of a graph using a fixed point set is NP-hard.

Cabello, Sergio

Displaying similar documents to “Planar embeddability of the vertices of a graph using a fixed point set is NP-hard.”

Efficient, proximity-preserving node overlap removal.

Gansner, Emden, Hu, Yifan (2010)

Journal of Graph Algorithms and Applications

Similarity:

On the approximation of min split-coloring and min cocoloring.

Demange, Marc, Ekim, Tinaz, De Werra, Dominique (2006)

Journal of Graph Algorithms and Applications

Similarity:

Adding tails to $C^{*}$ -correspondences.

Muhly, Paul S., Tomforde, Mark (2004)

Documenta Mathematica

Similarity:

Strong Chromatic Index Of Planar Graphs With Large Girth

Gerard Jennhwa Chang, Mickael Montassier, Arnaud Pêche, André Raspaud (2014)

Discussiones Mathematicae Graph Theory

Similarity:

Let Δ ≥ 4 be an integer. In this note, we prove that every planar graph with maximum degree Δ and girth at least 1 Δ+46 is strong (2Δ−1)-edgecolorable, that is best possible (in terms of number of colors) as soon as G contains two adjacent vertices of degree Δ. This improves [6] when Δ ≥ 6.

Dodgon's determinant-evaluation rule proved by TWO-TIMING MEN and WOMEN.

Zeilberger, Doron (1997)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Basic calculus of signed permutations. II: Finite analogues of Bessel functions. (Calcul basique des permutations signées. II: Analogues finis des fonctions de Bessel.)

Foata, Dominique, Han, Guo-Niu (1997)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A common recursion for Laplacians of matroids and shifted simplicial complexes.

Duval, Art M. (2005)

Documenta Mathematica

Similarity:

Solvability of a periodic type boundary value problem for first order scalar functional differential equations

Robert Hakl, Alexander Lomtatidze, Jiří Šremr (2004)

Archivum Mathematicum

Similarity:

Nonimprovable sufficient conditions for the solvability and unique solvability of the problem $u^{'} (t) = F (u) (t), u (a) - λ u (b) = h (u)$ are established, where $F : \to$ is a continuous operator satisfying the Carathèodory conditions, $h : \to R$ is a continuous functional, and $λ \in$ .

Slope filtrations revisited.

Kedlaya, Kiran S. (2005)

Documenta Mathematica

Similarity:

$C^{*}$ -algebras associated to coverings of $k$ -graphs.

Kumjian, Alex, Pask, David, Sims, Aidan (2008)

Documenta Mathematica

Similarity:

Noncommutative Cartan subalgebras of C*-algebras.

Exel, Ruy (2011)

The New York Journal of Mathematics [electronic only]

Similarity: