Planar Graphs
Hassler Whitney (1933)
Fundamenta Mathematicae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Hassler Whitney (1933)
Fundamenta Mathematicae
Similarity:
Maryam Atapour, Seyyed Sheikholeslami, Rana Hajypory, Lutz Volkmann (2010)
Open Mathematics
Similarity:
Johns, Garry, Sleno, Karen (1993)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Nicolas Beldiceanu, Thierry Petit, Guillaume Rochart (2006)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
This article presents a basic scheme for deriving systematically a filtering algorithm from the graph properties based representation of global constraints. This scheme is based on the bounds of the graph parameters used in the description of a global constraint. The article provides bounds for the most common used graph parameters.
Richard H. Hammack (2013)
Discussiones Mathematicae Graph Theory
Similarity:
To every graph (or digraph) A, there is an associated automorphism group Aut(A). Frucht’s theorem asserts the converse association; that for any finite group G there is a graph (or digraph) A for which Aut(A) ∼= G. A new operation on digraphs was introduced recently as an aid in solving certain questions regarding cancellation over the direct product of digraphs. Given a digraph A, its factorial A! is certain digraph whose vertex set is the permutations of V (A). The arc set E(A!) forms...
Lim, Chjan C., Van Patten, Gregory K. (2001)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Bohdan Zelinka (1971)
Časopis pro pěstování matematiky
Similarity:
Hajo Broersma, Xueliang Li (2002)
Discussiones Mathematicae Graph Theory
Similarity:
The concept of a line digraph is generalized to that of a directed path graph. The directed path graph Pₖ(D) of a digraph D is obtained by representing the directed paths on k vertices of D by vertices. Two vertices are joined by an arc whenever the corresponding directed paths in D form a directed path on k+1 vertices or form a directed cycle on k vertices in D. In this introductory paper several properties of P₃(D) are studied, in particular with respect to isomorphism and traversability....