Labeling Planar Graphs with Conditions on Girth and Distance Two
From MaRDI portal
Publication:4443137
DOI10.1137/S0895480101390448zbMath1041.05068MaRDI QIDQ4443137
Publication date: 8 January 2004
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\) ⋮ Optimal channel assignment and \(L(p,1)\)-labeling ⋮ Facial incidence colorings of embedded multigraphs ⋮ Planar graphs of girth at least five are square \((\delta + 2)\)-choosable ⋮ An improved bound on 2-distance coloring plane graphs with girth 5 ⋮ \(L(p,q)\)-labelling of \(K_{4}\)-minor free graphs ⋮ The 2-dipath chromatic number of Halin graphs ⋮ Coloring the square of a sparse graph \(G\) with almost \(\varDelta(G)\) colors ⋮ 2-distance coloring of a planar graph without 3, 4, 7-cycles ⋮ List 2-distance coloring of planar graphs with girth five ⋮ Sharp upper bound of injective coloring of planar graphs with girth at least 5 ⋮ The \(L(2,1)\)-labeling on planar graphs ⋮ 2-Distance Coloring of Sparse Graphs ⋮ Degeneracy and colorings of squares of planar graphs without 4-cycles ⋮ Graph \(r\)-hued colorings -- a survey ⋮ A new result of list 2-distance coloring of planar graphs with g(G) ≥ 5 ⋮ Distance-two labelings of digraphs ⋮ 2-distance coloring of planar graphs with girth 5 ⋮ An optimal square coloring of planar graphs ⋮ Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable ⋮ List 2-distance coloring of planar graphs ⋮ \(L(p,q)\)-labeling of a graph embeddable on the torus ⋮ Coloring the square of maximal Planar graphs with diameter two ⋮ Coloring the square of a \(K_{4}\)-minor free graph ⋮ Coloring squares of planar graphs with girth six ⋮ 2-distance coloring of planar graphs without adjacent 5-cycles ⋮ Coloring squares of planar graphs with maximum degree at most five ⋮ Coloring the square of graphs whose maximum average degree is less than 4 ⋮ On backbone coloring of graphs ⋮ On \(L (p, q)\)-labelling of planar graphs without cycles of length four ⋮ List \(r\)-hued chromatic number of graphs with bounded maximum average degrees ⋮ \(L(p,q)\)-labeling of sparse graphs ⋮ 2-distance colorings of integer distance graphs ⋮ Labeling planar graphs with a condition at distance two ⋮ \((2,1)\)-total labelling of outerplanar graphs ⋮ Chromatic number of square of maximal outerplanar graphs ⋮ Labelling planar graphs without 4-cycles with a condition on distance two ⋮ On 2-distance coloring of plane graphs with girth 5 ⋮ Injective coloring of planar graphs ⋮ Distance constrained labelings of planar graphs with no short cycles ⋮ The \(L(2,1)\)-labelling of trees ⋮ (2,1)-total labelling of trees with sparse vertices of maximum degree ⋮ A survey on labeling graphs with a condition at distance two ⋮ \((2,1)\)-Total number of trees with maximum degree three ⋮ List 2-distance coloring of planar graphs without short cycles ⋮ A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable ⋮ The list \(L(2,1)\)-labeling of planar graphs with large girth ⋮ List coloring the square of sparse graphs with large degree ⋮ The \(L(p, q)\)-labelling of planar graphs without 4-cycles ⋮ List‐Coloring the Squares of Planar Graphs without 4‐Cycles and 5‐Cycles ⋮ 2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles ⋮ Some results on distance two labelling of outerplanar graphs ⋮ \(L(p, q)\)-labeling of planar graphs with small girth ⋮ 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 ⋮ Optimal frequency assignment and planar list \(L(2, 1)\)-labeling ⋮ 2-Distance chromatic number of some graph products ⋮ 2-Distance coloring of planar graph ⋮ \((2,1)\)-total labeling of trees with large maximum degree
