The chromatic difference sequence of the Cartesian product of graphs
In this paper vertex colourings of simple undirected graphs G are considered. The chromatic difference sequence cds(G) of G is defined by \[ cds(G)=(a(1),a(2),...), \] where \(\sum^{t}_{j=1}a(j)\) is the maximum number of vertices in an induced t-colourable subgraph of G for \(t=1,2,..\).. Four main results are obtained: the chromatic difference sequence (cds) of bipartite graphs, the cds of the product of graphs with cds being nondrop flat and first-drop flat, the non-increasing theorem for powers of graphs and cds of powers of circulant graphs.
- The chromatic difference sequence of the Cartesian product of graphs. II
- Independence ratios of graph powers
- Graph products and the chromatic difference sequence of vertex-transitive graphs
- On the ultimate independence ratio of a graph
- On the ultimate normalized chromatic difference sequence of a graph
- On the bounds for the ultimate independence ratio of a graph
- Chromatic difference sequences and homomorphisms
- scientific article; zbMATH DE number 5778120 (Why is no real title available?)
- Circulants and Sequences
This page was built for publication: The chromatic difference sequence of the Cartesian product of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810524)