On \((p, 1)\)-total labelling of some 1-planar graphs
From MaRDI portal
Publication:2227112
DOI10.7151/dmgt.2208zbMath1458.05231OpenAlexW2917288642MaRDI QIDQ2227112
Publication date: 10 February 2021
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2208
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (7)
A note on global dominator coloring of graphs ⋮ On list \((p, 1)\)-total labellings of special planar graphs and 1-planar graphs ⋮ Unnamed Item ⋮ On \((p, 1)\)-total labelling of NIC-planar graphs ⋮ Unnamed Item ⋮ Incidence coloring of mycielskians with fast algorithm ⋮ 1-planar graphs without 4-cycles or 5-cycles are 5-colorable
Cites Work
- Unnamed Item
- Unnamed Item
- On \((p,1)\)-total labelling of planar graphs
- On \((p,1)\)-total labelling of 1-planar graphs
- List edge and list total coloring of 1-planar graphs
- The structure of 1-planar graphs
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
- On edge colorings of \(1\)-planar graphs
- A structure of 1-planar graph and its applications to coloring problems
- \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
- Ein Sechsfarbenproblem auf der Kugel
- An annotated bibliography on 1-planarity
- \((p,1)\)-total labelling of graphs
- (d,1)-total labeling of graphs with a given maximum average degree
- Total-Coloring of Plane Graphs with Maximum Degree Nine
- Labelling Graphs with a Condition at Distance 2
- A new proof of the 6 color theorem
- (2,1)-total labelling of planar graphs with large maximum degree
This page was built for publication: On \((p, 1)\)-total labelling of some 1-planar graphs