A class of weakly perfect graphs

DOI10.1007/S10587-010-0067-6zbMATH Open1224.05376OpenAlexW2042734910MaRDI QIDQ3073528FDOQ3073528

Authors: H. R. Maimani, M. R. Pournaki, Siamak Yassemi 

Publication date: 11 February 2011

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/196574

Recommendations

• Weakly perfect graphs arising from rings
• New classes of perfect graphs
• Chromatic and clique numbers of a class of perfect graphs
• A note on perfect graphs
• scientific article; zbMATH DE number 3889565

zbMATH Keywords

chromatic numberclique numberweakly perfect graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Arithmetic functions; related numbers; inversion formulas (11A25) Perfect graphs (05C17)

Cites Work

• Title not available (Why is that?)
• Graph Colorings
• Channel assignment and weighted coloring

Cited In (7)

• Perfect unit graphs of commutative Artinian rings
• Note on structural properties of graphs
• Coloring of cozero-divisor graphs of commutative von Neumann regular rings
• Spectrum of Graphs over Rings: A Survey
• Vertex-transitive CIS graphs
• Wiener index of graphs over rings: a survey
• Weakly perfect graphs arising from rings

This page was built for publication: A class of weakly perfect graphs

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