Combinatorics and Graph Theory


Characterization of Partitions for Solid Graphs

Authors: Natasha Lee, Joan Portmann

The paper deals with the problems of characterization of simple graphical partitions belonging to the solid graphs, i.e. graphs, in which there are no four of vertices such that it is possible some shift of edges incidental to them and with characterization of the one class of steady graphs too. The necessary and sufficient conditions for the partition belonging to the solid graph have been established.

Comments: 5 Pages.

Download: PDF

Submission history

[v1] 2012-11-14 10:59:09

Unique-IP document downloads: 71 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus