View in EDS

Partial Colorings of Graphs

Saved in:
Bibliographic Details
Title: Partial Colorings of Graphs
Authors: Jakubowski, Matthew
Summary: Recently, there has been great interest in counting the number of homomorphisms from a graph G into a fixed image graph H. For this thesis, we let H be a complete graph on three vertices with exactly one looped vertex. Homomorphisms from a graph G to this H correspond to partial proper two-colorings of the vertices of G. We are mainly interested in finding which graphs maximize the number of partial two-colorings given a graph with n vertices and m edges. The general result is given for all graphs with m < n -1 as well as basic enumerative results for some very common graphs.
URL: https://digitalcommons.montclair.edu/etd/432
Database: OpenDissertations
FullText Text:
  Availability: 0
Header DbId: ddu
DbLabel: OpenDissertations
An: ddu.oai.digitalcommons.montclair.edu.etd.1433
AccessLevel: 6
PubType: Dissertation/ Thesis
PubTypeId: dissertation
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Partial Colorings of Graphs
– Name: Author
  Label: Authors
  Group: Au
  Data: &lt;searchLink fieldCode=&quot;AR&quot; term=&quot;%22Jakubowski%2C+Matthew%22&quot;&gt;Jakubowski, Matthew&lt;/searchLink&gt;
– Name: Abstract
  Label: Summary
  Group: Ab
  Data: Recently, there has been great interest in counting the number of homomorphisms from a graph G into a fixed image graph H. For this thesis, we let H be a complete graph on three vertices with exactly one looped vertex. Homomorphisms from a graph G to this H correspond to partial proper two-colorings of the vertices of G. We are mainly interested in finding which graphs maximize the number of partial two-colorings given a graph with n vertices and m edges. The general result is given for all graphs with m &lt; n -1 as well as basic enumerative results for some very common graphs.
– Name: URL
  Label: URL
  Group: URL
  Data: &lt;link linkTarget=&quot;URL&quot; linkTerm=&quot;https://digitalcommons.montclair.edu/etd/432&quot; linkWindow=&quot;_blank&quot;&gt;https://digitalcommons.montclair.edu/etd/432&lt;/link&gt;
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=ddu&AN=ddu.oai.digitalcommons.montclair.edu.etd.1433
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Code: eng
        Text: English
    Subjects:
      – SubjectFull: Mathematics
        Type: general
      – SubjectFull: Graph coloring, Homomorphisms (Mathematics)
        Type: general
    Titles:
      – TitleFull: Partial Colorings of Graphs
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Jakubowski, Matthew
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 05
              Type: published
              Y: 2014
ResultId 1