Premium
Maximal σ‐polynomials of connected 3‐chromatic graphs
Author(s) -
Tomescu Ioan
Publication year - 2003
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.10115
Subject(s) - combinatorics , mathematics , chromatic scale , graph , windmill graph , discrete mathematics , friendship graph , critical graph , graph power , line graph
Abstract In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if c i ( G ) ≤ c i ( H ) holds for every i , k ≤ i ≤ n and at least one inequality is strict, where c i ( G ) denotes the number of i ‐color partitions of G . In this paper the first ⌈ n /2 ⌉ levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003