Chromatic number of square of maximal outerplanar graphs
From MaRDI portal
Publication:2466444
DOI10.1007/S11766-007-0204-7zbMATH Open1136.05020OpenAlexW2146132922MaRDI QIDQ2466444FDOQ2466444
Authors: Xiao Fang Luo 
Publication date: 14 January 2008
Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11766-007-0204-7
Recommendations
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- \(L(h,1)\)-labeling subclasses of planar graphs
- A bound on the chromatic number of the square of a planar graph
- Labeling Planar Graphs with Conditions on Girth and Distance Two
- Coloring the square of a planar graph
- Circular Distance Two Labeling and the $\lambda$-Number for Outerplanar Graphs
- Coloring the square of a \(K_{4}\)-minor free graph
- Note on coloring the square of an outerplanar graph
Cited In (9)
- On colorings of squares of outerplanar graphs
- A note on the chromatic number of the square of the Cartesian product of two cycles
- Coloring the square of an outerplanar graph
- Note on coloring the square of an outerplanar graph
- Upper bound on chromatic number of square graph of sparse graphs
- Graph \(r\)-hued colorings -- a survey
- Coloring squares of planar graphs with maximum degree at most five
- Title not available (Why is that?)
- Vertex coloring the square of outerplanar graphs of low degree
This page was built for publication: Chromatic number of square of maximal outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2466444)
