Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Coloring and Domination of Vertices in Triangle-free Graphs

Ronald Dutton 1
1Department of Computer Science University of Central Florida, Orlando FL 32816
  • Published: 30/12/2019

Abstract

Any dominating set of vertices in a triangle-free graph can be used to specify a graph coloring with at most one color class more than the number of vertices in the dominating set. This bound is sharp for many graphs. Properties of graphs for which this bound is achieved are presented.

Keywords: Triangle-free graphs, Chromatic number, Domination number, Extremal graphs.
Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Ronald Dutton . Coloring and Domination of Vertices in Triangle-free Graphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 111. -. DOI: .