On L2-Golourings of a Graph

DOI10.1080/02522667.1985.10698825MaRDI QIDQ3749077zbMATH OpenOpenAlexFDO

Authors Mario Gionfriddo, Scott A. Vanstone

Publication date 1985

Published in Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02522667.1985.10698825

zbMATH Keywords

chromatic numberclique number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• On the parameter \(v_ 2(h)\) for \(L_ 2\)-coloured graphs
• On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs
• Wegner's conjecture on 2-distance coloring
• Claw-free graphs. VI: Colouring
• The chromatic number of graphs which induce neither \(K_{1,3}\) nor \(K_ 5-e\)

Cited in

(9)

• On the parameter \(v_ 2(h)\) for \(L_ 2\)-coloured graphs
• On small graphs with highly imperfect powers
• On the coloured graph structure of Lusztig's canonical basis
• \(F\)-WORM colorings: results for 2-connected graphs
• Solutions of some L(2, 1)-coloring related open problems
• scientific article; zbMATH DE number 2086232 (Why is no real title available?)
• scientific article; zbMATH DE number 1159270 (Why is no real title available?)
• A Frameless 2-Coloring of the Plane Lattice
• Guest editorial: Special issue in honor of Scott A. Vanstone

This page was built for publication: On L₂-Golourings of a Graph

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