Facebook Instagram Twitter RSS Feed PodBean Back to top on side

Isomorphism classes of one edge transformed graphs

In: Tatra Mountains Mathematical Publications, vol. 9, no. 3
Krystyna T. Balińska - Louis V. Quintas
Detaily:
Rok, strany: 1996, 57 - 67
O článku:
The isomorphism classes and the chromatic numbers of the one edge deleted subgraphs and the one edge extended supergraphs of a graph are studied. Graphs are determined having the property that either every one edge deleted subgraph or every one edge extended supergraph is isomorphically distinct. The following is one of a number of open problems considered. For a given chromatic number $χ0$, characterize the class of graphs $\langle G\rangle$ such that $χ(G)=χ0$ and every one edge extended supergraph of $G$ has chromatic number $χ0$. Similarly, characterize the class of graphs $\langle H\rangle$ such that $χ(H)=χ0$ and every one edge extended supergraph of $H$ has chromatic number $χ0+1$.
Ako citovať:
ISO 690:
Balińska, K., Quintas, L. 1996. Isomorphism classes of one edge transformed graphs. In Tatra Mountains Mathematical Publications, vol. 9, no.3, pp. 57-67. 1210-3195.

APA:
Balińska, K., Quintas, L. (1996). Isomorphism classes of one edge transformed graphs. Tatra Mountains Mathematical Publications, 9(3), 57-67. 1210-3195.