scientific article; zbMATH DE number 2086232

MaRDI QIDQ3044330zbMATH OpenFDO

Authors Rossella Petreschi, Tiziana Calamoneri

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2286/22860236.htm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• \(\lambda\)-coloring matrogenic graphs
• On L₂-Golourings of a Graph
• On the μ-colorings of a matroid
• On some \(L(2, 1)\)-coloring parameters of certain graph classes
• The L(2,1)-labelings on a class of connected full colorable graphs
• Generalized colouring (matrix partitions) of cographs
• Full Color Theorems for L(2,1)-Colorings
• On (1,l)-coloring of incidentors of multigraphs
• \([1,1,2]\)-colorings of complete graphs
• scientific article; zbMATH DE number 671731

Cited in

(6)

• Approximate L(δ₁,δ₂,…,δ_t)‐coloring of trees and interval graphs
• On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations
• On the μ-colorings of a matroid
• Labeling trees with a condition at distance two
• Labeling trees with a condition at distance two
• \(\lambda\)-coloring matrogenic graphs

This page was built for publication:

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