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

DOI10.1007/S11766-003-0013-6zbMATH Open1109.05045OpenAlexW2325367774MaRDI QIDQ854573FDOQ854573

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

Recommendations

• On cocolourings and cochromatic numbers of graphs
• Publication:4722090
• Fractional cocoloring of graphs
• Chromatic number versus chromatic number in graphs with bounded clique number
• scientific article; zbMATH DE number 434912

zbMATH Keywords

partitionclique number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Chromatic number versus chromatic number in graphs with bounded clique number
• Title not available (Why is that?)

Cited In (2)

• Structure of the spectrum of infinite dimensional Hamiltonian operators
• Generalized inverse of upper triangular infinite dimensional Hamiltonian operators

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q854573)