\(\lambda\)-coloring matrogenic graphs

DOI10.1016/j.dam.2006.03.036zbMath1107.05087OpenAlexW2020288784MaRDI QIDQ860405

Tiziana Calamoneri, Rossella Petreschi

Publication date: 9 January 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.03.036

zbMATH Keywords

cographssplit graphsthreshold graphschannelsmatroidal graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Communication theory (94A05)

Related Items (5)

Unnamed Item ⋮ On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs ⋮ The \(L(2,1)\)-labeling of unigraphs ⋮ Recognition of Unigraphs through Superposition of Graphs (Extended Abstract) ⋮ Labeling bipartite permutation graphs with a condition at distance two

Cites Work

• Degree sequences of matrogenic graphs
• Matroidal graphs
• \(L(h,1)\)-labeling subclasses of planar graphs
• Threshold graphs and related topics
• Labelling Graphs with a Condition at Distance 2
• A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
• Graph Classes: A Survey
• Labeling Chordal Graphs: Distance Two Condition
• The $L(2,1)$-Labeling Problem on Graphs
• 25 pretty graph colouring problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(\lambda\)-coloring matrogenic graphs