<?xml version='1.0' encoding='utf-8'?>
<mods xmlns="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" version="3.7" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-7.xsd">
  <titleInfo>
    <title>TOPICS IN GRAPH FALL-COLORING</title>
  </titleInfo>
  <name>
    <role>
      <roleTerm type="text" authority="marcrelator" authorityURI="http://id.loc.gov/vocabulary/relators" valueURI="http://id.loc.gov/vocabulary/relators/cre">creator</roleTerm>
    </role>
    <namePart>Mitillos, Christodoulos</namePart>
  </name>
  <name authority="wikidata" authorityURI="https://www.wikidata.org" valueURI="https://www.wikidata.org/wiki/Q102111462">
    <role>
      <roleTerm type="text" authority="marcrelator" authorityURI="http://id.loc.gov/vocabulary/relators" valueURI="http://id.loc.gov/vocabulary/relators/ths">advisor</roleTerm>
    </role>
    <namePart>Kaul, Hemanshu</namePart>
  </name>
  <abstract>Graph fall-coloring, also known as idomatic partitioning or independent domatic partitioning of graphs, was formally introduced by Dunbar, Hedetniemi, Hedetniemi, Jacobs, Knisely, Laskar, and Rall in 2000 [1] as a simple extension of graph coloring and graph domination. It asks for a partition of the vertex set of a given graph into independent dominating sets. In this thesis, we will study a number of questions related to this concept. In the rst chapter we will give a brief background to graph theory, and introduce the topic of graph fall-coloring, after looking at the fundamental topics it builds on. In the second chapter, we identify the e ects on fall-colorability of various graphical operators, and look at the fall-colorability of certain families of graphs. In the third chapter we will explore certain constructions which create fall-colorable graphs given certain restrictions, and look at the interaction of fall-colorings and non-fall-colorings. Finally, in the fourth chapter, we lay the foundations to establish a connection between fall-coloring and certain existing open problems in graph theory, providing new possible avenues for exploring their solutions. We then provide two applied problems which can be solved with fall-coloring, and which motivate the notion of fall-nearcoloring. We also provide further questions in fall-coloring for future research. Keywords: Graph Fall-coloring, Idomatic Partition, Independent Dominating Sets, Chromatic number, Graph products.</abstract>
  <note type="provenance">Submitted by Erma Thomas (thomase@iit.edu) on 2017-05-19T22:18:39Z No. of bitstreams: 1 etdadmin_upload_450399.zip: 538622 bytes, checksum: baaf1ed5ca8515d5227626dbe61d1e9c (MD5)</note>
  <note type="provenance">Made available in DSpace on 2017-05-19T22:18:39Z (GMT). No. of bitstreams: 1 etdadmin_upload_450399.zip: 538622 bytes, checksum: baaf1ed5ca8515d5227626dbe61d1e9c (MD5) Previous issue date: 2016-07</note>
  <note type="thesis">Ph.D. in Applied Mechanics, July 2016</note>
  <originInfo>
    <dateCaptured>2016</dateCaptured>
  </originInfo>
  <originInfo>
    <dateCreated keyDate="yes">2016-07</dateCreated>
  </originInfo>
  <identifier type="hdl">http://hdl.handle.net/10560/4081</identifier>
  <language>
    <languageTerm type="code" authority="rfc3066">en</languageTerm>
  </language>
  <subject>
    <topic>Graph Fall-coloring</topic>
  </subject>
  <subject>
    <topic>Graph Operators</topic>
  </subject>
  <subject>
    <topic>Graph Products</topic>
  </subject>
  <subject>
    <topic>Graph Theory</topic>
  </subject>
  <subject>
    <topic>Idomatic Partitions</topic>
  </subject>
  <subject>
    <topic>Independent Dominating Sets</topic>
  </subject>
  <typeOfResource authority="aat" valueURI="http://vocab.getty.edu/page/aat/300028029">Dissertation</typeOfResource>
  <physicalDescription>
    <digitalOrigin>born digital</digitalOrigin>
    <internetMediaType>application/pdf</internetMediaType>
  </physicalDescription>
  <accessCondition type="useAndReproduction" displayLabel="rightsstatements.org">In Copyright</accessCondition>
  <accessCondition type="useAndReproduction" displayLabel="rightsstatements.orgURI">http://rightsstatements.org/page/InC/1.0/</accessCondition>
  <accessCondition type="restrictionOnAccess">Restricted Access</accessCondition>
  <name type="corporate">
    <namePart>MATH / Applied Mathematics</namePart>
    <affiliation>Illinois Institute of Technology</affiliation>
    <role>
      <roleTerm type="text">Affiliated department</roleTerm>
    </role>
  </name>
</mods>