A lower bound on cochromatic number for line graphs of a kind of graphs

DOI10.1007/S11766-003-0013-6zbMath1109.05045OpenAlexW2325367774MaRDI QIDQ854573

Xiang'en Chen, Xinsheng Liu, Lifeng Ou

Publication date: 5 December 2006

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-003-0013-6

zbMATH Keywords

partitionclique number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Structure of the spectrum of infinite dimensional Hamiltonian operators ⋮ Generalized Inverse of Upper Triangular Infinite Dimensional Hamiltonian Operators

Cites Work

• Chromatic number versus chromatic number in graphs with bounded clique number
• Unnamed Item
• Unnamed Item

This page was built for publication: A lower bound on cochromatic number for line graphs of a kind of graphs