Strict neighbor-distinguishing index of K₄-minor-free graphs

DOI10.1016/J.DAM.2023.01.017MaRDI QIDQ2686134zbMATH OpenOpenAlexFDO

Authors Jing Gu, Lina Zheng, Yiqiao Wang, Weifan Wang

Publication date 24 February 2023

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2023.01.017

zbMATH Keywords

\(K_4\)-minor-free graphformal graphlocal neighbor-distinguishing indexstrict neighbor-distinguishing index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Graph minors (05C83) Ramsey theory (05D10)

Recommendations

• Neighbor sum distinguishing index of \(K_4\)-minor free graphs
• Strict neighbor-distinguishing total index of graphs
• Strict neighbor-distinguishing index of subcubic graphs
• Strong chromatic index of K₄-minor free graphs
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• Neighbor sum distinguishing edge colorings of \({K_4}\)-minor free graphs
• Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph
• Distance constrained labelings of \(K_{4}\)-minor free graphs
• Distance Constrained Labelings of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-minor Free Graphs
• Some bounds on the neighbor-distinguishing index of graphs

Cites work

• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• r-strong edge colorings of graphs
• A characterization on the adjacent vertex distinguishing index of planar graphs with large maximum degree
• Adjacent strong edge coloring of graphs
• Edge-partitions of graphs and their neighbor-distinguishing index
• On Neighbor-Distinguishing Index of Planar Graphs
• On the inclusion chromatic index of a graph
• On the Smarandachely-adjacent-vertex edge coloring of some double graphs
• Progress on the adjacent vertex distinguishing edge coloring conjecture
• Some bounds on the neighbor-distinguishing index of graphs
• Strict neighbor-distinguishing index of subcubic graphs
• Topology of series-parallel networks

Cited in

(9)

• Distance constrained labelings of \(K_{4}\)-minor free graphs
• Strict neighbor-distinguishing total index of graphs
• Neighbor sum distinguishing index of \(K_4\)-minor free graphs
• Strict neighbor-distinguishing index of subcubic graphs
• Local neighbor-distinguishing index of graphs
• Distance Constrained Labelings of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-minor Free Graphs
• On the inclusion chromatic index of a Halin graph
• Strict neighbor-distinguishing index of outerplanar graphs
• On the packing edge-colorings of subcubic K₄-minor free graphs

This page was built for publication: Strict neighbor-distinguishing index of \(K_4\)-minor-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2686134)