On \((p,1)\)-total labelling of 1-planar graphs (Q651281): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Coloring vertices and faces of locally planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3679212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the total coloring of planar graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of the 6 color theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colouring of 1-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colorings of planar graphs with large maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: List edge and list total colourings of multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colourings of planar graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((2,1)\)-total labelling of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of 1-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((p,1)\)-total labelling of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On local structure of 1-planar graphs of minimum degree 5 and girth 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On local properties of 1-planar graphs with high minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total-Coloring of Plane Graphs with Maximum Degree Nine / rank
 
Normal rank
Property / cites work
 
Property / cites work: (d,1)-total labeling of graphs with a given maximum average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein Sechsfarbenproblem auf der Kugel / rank
 
Normal rank
Property / cites work
 
Property / cites work: On total 9-coloring planar graphs of maximum degree seven / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coupled choosability of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the $\lambda$-Number of $Q_n $ and Related Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List-edge and list-total colorings of graphs embedded on hyperbolic surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on labeling graphs with a condition at distance two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4909715 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On edge colorings of 1-planar graphs without adjacent triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Coloring of Triangle-Free 1-Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-平面图的结构性质及其在无圈边染色上的应用 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light subgraphs in the family of 1-planar graphs with high minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On edge colorings of \(1\)-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List edge and list total coloring of 1-planar graphs / rank
 
Normal rank

Latest revision as of 18:15, 4 July 2024

scientific article
Language Label Description Also known as
English
On \((p,1)\)-total labelling of 1-planar graphs
scientific article

    Statements

    On \((p,1)\)-total labelling of 1-planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    12 December 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    1-planar graph
    0 references
    Alternating subgraph
    0 references
    Master
    0 references
    Total labelling
    0 references
    Discharging
    0 references
    frequency assignment
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references