Vol. 11, No. 2, 2018

Download this article
Download this article For screen
For printing
Recent Issues

Volume 13
Issue 3, 361–539
Issue 2, 181–360
Issue 1, 1–180

Volume 12, 8 issues

Volume 11, 5 issues

Volume 10, 5 issues

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
About the Journal
Editorial Board
Editors’ Interests
Subscriptions
 
Submission Guidelines
Submission Form
Policies for Authors
Ethics Statement
 
ISSN: 1944-4184 (e-only)
ISSN: 1944-4176 (print)
Author Index
Coming Soon
 
Other MSP Journals
This article is available for purchase or by subscription. See below.
Forbidden subgraphs of coloring graphs

Francisco Alvarado, Ashley Butts, Lauren Farquhar and Heather M. Russell

Vol. 11 (2018), No. 2, 311–324
Abstract

Given a graph G, its k-coloring graph has vertex set given by the proper k-colorings of the vertices of G with two k-colorings adjacent if and only if they differ at exactly one vertex. Beier et al. (Discrete Math. 339:8 (2016), 2100–2112) give various characterizations of coloring graphs, including finding graphs which never arise as induced subgraphs of coloring graphs. These are called forbidden subgraphs, and if no proper subgraph of a forbidden subgraph is forbidden, it is called minimal forbidden. In this paper, we construct a finite collection of minimal forbidden subgraphs that come from modifying theta graphs. We also construct an infinite family of minimal forbidden subgraphs similar to the infinite family found by Beier et al.

PDF Access Denied

However, your active subscription may be available on Project Euclid at
https://projecteuclid.org/involve

We have not been able to recognize your IP address 34.234.207.100 as that of a subscriber to this journal.
Online access to the content of recent issues is by subscription, or purchase of single articles.

Please contact your institution's librarian suggesting a subscription, for example by using our journal-recom­mendation form. Or, visit our subscription page for instructions on purchasing a subscription.

You may also contact us at contact@msp.org
or by using our contact form.

Or, you may purchase this single article for USD 30.00:

Keywords
proper graph coloring, coloring graph, forbidden subgraph
Mathematical Subject Classification 2010
Primary: 05C15
Milestones
Received: 10 November 2016
Revised: 14 May 2017
Accepted: 19 June 2017
Published: 17 September 2017

Communicated by Jerrold Griggs
Authors
Francisco Alvarado
California State University
Los Angeles, CA
United States
Ashley Butts
University of the Pacific
Stockton, CA
United States
Lauren Farquhar
Department of Mathematics
University of Colorado
Boulder, CO
United States
Heather M. Russell
Department of Mathematics
University of Richmond
Richmond, VA
United States