Forbidden subgraph colorings, Oriented colorings and intersection dimensions of graphs (Record no. 48846)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 02118nam a2200253Ia 4500 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 160627s2010||||xx |||||||||||||| ||und|| |
| 080 ## - UNIVERSAL DECIMAL CLASSIFICATION NUMBER | |
| Universal Decimal Classification number | HBNI Th 32 |
| 100 ## - MAIN ENTRY--AUTHOR NAME | |
| Personal name | Aravind, N. R. |
| Relator term | author |
| 245 ## - TITLE STATEMENT | |
| Title | Forbidden subgraph colorings, Oriented colorings and intersection dimensions of graphs |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Year of publication | 2010 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | 101p. |
| 502 ## - DISSERTATION NOTE | |
| Dissertation note | 2010 |
| 502 ## - DISSERTATION NOTE | |
| Degree Type | Ph.D |
| 502 ## - DISSERTATION NOTE | |
| Name of granting institution | HBNI |
| 520 3# - SUMMARY, ETC. | |
| Summary, etc | This thesis deals mainly with two related coloring problems - forbidden subgraph colorings and oriented colorings. The former deals with proper colorings of vertices or edges of a graph with constraints on the union of color classes. A well-known example is the acyclic vertex coloring in which a proper coloring is required such that the union of any two color classes is acyclic. Other well studied examples include the acyclic edge coloring and star coloring. Our focus in this thesis is a generalization of these special types of colorings. Oriented coloring deals with colorings of oriented graphs (directed graphs obtained by orienting each edge of a simple undirected graph). Specifically, an oriented coloring is a homomorphism to an oriented graph, the vertices of the target graph being considered as the colors assigned to the vertices of the source graph. The upper bounds for forbidden subgraph chromatic numbers is found in terms of the maximum degree. For the union of two color classes, and it is shown that the asymptotic tightness of our bounds by a probabilistic contstruction. And that the oriented chromatic number of a graph can be bounded in terms of the forbidden subgraph chromatic numbers. In conjunction with afore-mentioned results, this allowed the author to prove improved bounds on oriented chromatic numbers of graphs on surfaces. |
| 650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Computer Science |
| 653 10 - INDEX TERM--UNCONTROLLED | |
| Uncontrolled term | Graph Coloring |
| 653 10 - INDEX TERM--UNCONTROLLED | |
| Uncontrolled term | HBNI Th 32 |
| 720 1# - ADDED ENTRY--UNCONTROLLED NAME | |
| Thesis Advisor | Balasubramanian, R. |
| Relator term | Thesis advisor [ths] |
| 720 1# - ADDED ENTRY--UNCONTROLLED NAME | |
| Thesis Advisor | Subramanian, C.R. |
| Relator term | Thesis advisor [ths] |
| 856 ## - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | http://www.imsc.res.in/xmlui/handle/123456789/258 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | THESIS & DISSERTATION |
| Withdrawn status | Lost status | Damaged status | Not for loan | Current library | Full call number | Accession Number | Uniform Resource Identifier | Koha item type |
|---|---|---|---|---|---|---|---|---|
| IMSc Library | HBNI Th 32 | 66116 | http://www.imsc.res.in/xmlui/handle/123456789/258 | THESIS & DISSERTATION |