EuDML | Browse

Page 1

Displaying 1 – 8 of 8

Hadwiger numbers of finite graphs

Bohdan Zelinka (1976)

Mathematica Slovaca

Historická perspektiva konečné matematiky

Jaroslav Nešetřil (1986)

Pokroky matematiky, fyziky a astronomie

Homogeneously embedding stratified graphs in stratified graphs

Gary Chartrand, Donald W. Vanderjagt, Ping Zhang (2005)

Mathematica Bohemica

A 2-stratified graph $G$ is a graph whose vertex set has been partitioned into two subsets, called the strata or color classes of $G$ . Two $2$ -stratified graphs $G$ and $H$ are isomorphic if there exists a color-preserving isomorphism $φ$ from $G$ to $H$ . A $2$ -stratified graph $G$ is said to be homogeneously embedded in a $2$ -stratified graph $H$ if for every vertex $x$ of $G$ and every vertex $y$ of $H$ , where $x$ and $y$ are colored the same, there exists an induced $2$ -stratified subgraph $H^{'}$ of $H$ containing $y$ and a color-preserving...