Planar permutation graphs of paths
Planar Ramsey numbers
The planar Ramsey number PR(G,H) is defined as the smallest integer n for which any 2-colouring of edges of Kₙ with red and blue, where red edges induce a planar graph, leads to either a red copy of G, or a blue H. In this note we study the weak induced version of the planar Ramsey number in the case when the second graph is complete.
Planar Realizations of Nonlinear Davenport-Schinzel Sequences by Segments.
Planarity thresholds for two types of random subgraphs of the -cube
Planarizing graphs---a survey and annotated bibliography.
Plancherel averages: remarks on a paper by Stanley.
Plane partition diamonds and generalizations.
Plane partitions IV: A conjecture of Mills-Robbins-Rumsey.
Plane trivalent trees and their patterns
The aim of this paper is to characterize the patterns of successive distances of leaves in plane trivalent trees, and give a very short characterization of their parity pattern. Besides, we count how many trees satisfy some given sequences of patterns.
Platonic hypermaps.
Playing with some identities of Andrews.
Plethysm and the non-compact groups .
Plongements lipschitziens dans un espace pentagonal
Plus court chemin avec contraintes d'horaires
Pₘ-saturated bipartite graphs with minimum size
A graph G is said to be H-saturated if G is H-free i.e., (G has no subgraph isomorphic to H) and adding any new edge to G creates a copy of H in G. In 1986 L. Kászonyi and Zs. Tuza considered the following problem: for given m and n find the minimum size sat(n;Pₘ) of Pₘ-saturated graph of order n. They gave the number sat(n;Pₘ) for n big enough. We deal with similar problem for bipartite graphs.
Počátkové nauky o determinantech. [I.]
Počátkové nauky o determinantech. [II.]
Počátkové nauky o determinantech. [III.]
Poincaré and graph theory
Poincaré polynomials for unitary reflection groups.