Labeling Planar Graphs with Conditions on Girth and Distance Two
From MaRDI portal
Recommendations
Cited in
(70)- Some results on distance two labelling of outerplanar graphs
- Some results on the incidence coloring number of a graph
- Linear coloring of planar graphs with large girth
- Distance constrained labelings of \(K_{4}\)-minor free graphs
- Coloring the square of a \(K_{4}\)-minor free graph
- Optimal channel assignment and \(L(p,1)\)-labeling
- Facial incidence colorings of embedded multigraphs
- Planar graphs of girth at least five are square ( + 2)-choosable
- 2-distance coloring of planar graphs with girth 5
- List r-hued chromatic number of graphs with bounded maximum average degrees
- 2-distance colorings of integer distance graphs
- An optimal square coloring of planar graphs
- L(p,q)-labeling of sparse graphs
- The list \(L(2,1)\)-labeling of planar graphs with large girth
- Optimal frequency assignment and planar list L(2, 1)-labeling
- List 2-distance coloring of planar graphs with girth five
- Sharp upper bound of injective coloring of planar graphs with girth at least 5
- Graph \(r\)-hued colorings -- a survey
- \((2,1)\)-total labeling of trees with large maximum degree
- A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\)
- Coloring squares of planar graphs with girth six
- Labelling of some planar graphs with a condition at distance two
- Labeling planar graphs with a condition at distance two
- \((2,1)\)-total labelling of outerplanar graphs
- Chromatic number of square of maximal outerplanar graphs
- The L(2,1)-labelling of trees
- A survey on labeling graphs with a condition at distance two
- Degeneracy and colorings of squares of planar graphs without 4-cycles
- Coloring squares of planar graphs with maximum degree at most five
- On L (p, q)-labelling of planar graphs without cycles of length four
- List 2-distance coloring of planar graphs without short cycles
- The L(p,q)-labeling of planar graphs with girth g(G) 6
- The L(p,q)-labeling of planar graphs with girth g(G) 5
- Labeling of planar graphs with a condition on distance two
- An improved bound on 2-distance coloring plane graphs with girth 5
- Coloring the square of a sparse graph G with almost (G) colors
- 2-distance coloring of a planar graph without 3, 4, 7-cycles
- scientific article; zbMATH DE number 5763155 (Why is no real title available?)
- Graphs with maximum degree 17 and maximum average degree less than 3 are list 2-distance ( +2)-colorable
- L(p,q)-labeling of a graph embeddable on the torus
- On backbone coloring of graphs
- A new result of list 2-distance coloring of planar graphs with g(G) 5
- The L(2,1)-labeling of planar graphs with maximum degree at most six
- List-coloring the squares of planar graphs without 4-cycles and 5-cycles
- 2-distance coloring of planar graph
- Adjacency Labelling for Planar Graphs (and Beyond)
- On 2-distance coloring of plane graphs with girth 5
- 2-distance coloring of planar graphs without 4-cycles and 5-cycles
- L(p,q)-labelling of planar graphs with high maximum degree
- 2-distance chromatic number of some graph products
- Injective coloring of planar graphs
- A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable
- Coloring the square of maximal Planar graphs with diameter two
- 2-distance coloring of planar graphs without adjacent 5-cycles
- 2-distance coloring of sparse graphs
- Incidence coloring of outer-1-planar graphs
- The 2-distance chromatic number of planar graphs without 3,4,8-cycles
- List coloring the square of sparse graphs with large degree
- The L(p, q)-labelling of planar graphs without 4-cycles
- L(p, q)-labeling of planar graphs with small girth
- \(L(p,q)\)-labelling of \(K_{4}\)-minor free graphs
- The 2-dipath chromatic number of Halin graphs
- The \(L(2,1)\)-labeling on planar graphs
- Distance-two labelings of digraphs
- List 2-distance coloring of planar graphs
- Coloring the square of graphs whose maximum average degree is less than 4
- Labelling planar graphs without 4-cycles with a condition on distance two
- Distance constrained labelings of planar graphs with no short cycles
- (2,1)-total labelling of trees with sparse vertices of maximum degree
- \((2,1)\)-Total number of trees with maximum degree three
This page was built for publication: Labeling Planar Graphs with Conditions on Girth and Distance Two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4443137)
