Chromatic numbers of competition graphs

DOI10.1016/0024-3795(94)00227-5zbMath0821.05024OpenAlexW1987098044MaRDI QIDQ1805322

Sarah K. Merz, J. Richard Lundgren, Craig W. Rasmussen

Publication date: 11 May 1995

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(94)00227-5

zbMATH Keywords

characterizationchromatic numbercompetition graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Structural properties and hamiltonicity of neighborhood graphs ⋮ Connected triangle-free \(m\)-step competition graphs ⋮ On the radius of neighborhood graphs ⋮ The \(m\)-step competition graph of a digraph

Cites Work

• Interval competition graphs of symmetric digraphs
• Two-step graphs of trees
• Characterizations of strongly chordal graphs
• On powers and centers of chordal graphs
• Labeling algorithms for domination problems in sun-free chordal graphs
• \((i,j)\) competition graphs
• Parallel concepts in graph theory
• A characterization of graphs with interval two-step graphs
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Chromatic numbers of competition graphs