Pages that link to "Item:Q2352066"
From MaRDI portal
The following pages link to Some bounds on the neighbor-distinguishing index of graphs (Q2352066):
Displaying 15 items.
- A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (Q288235) (← links)
- 2-distance vertex-distinguishing index of subcubic graphs (Q724740) (← links)
- Upper bounds for adjacent vertex-distinguishing edge coloring (Q1702826) (← links)
- An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs (Q1709550) (← links)
- Neighbor sum distinguishing index of subcubic graphs (Q2014224) (← links)
- On the neighbor-distinguishing indices of planar graphs (Q2117565) (← links)
- A general framework for analysing the mortality experience of a large portfolio of lives: with an application to the UK universities superannuation scheme (Q2157231) (← links)
- Two-distance vertex-distinguishing index of sparse subcubic graphs (Q2186287) (← links)
- Edge-partitions of graphs and their neighbor-distinguishing index (Q2404402) (← links)
- Strict neighbor-distinguishing index of subcubic graphs (Q2657091) (← links)
- Neighbor-distinguishing indices of planar graphs with maximum degree ten (Q2686132) (← links)
- Strict neighbor-distinguishing index of \(K_4\)-minor-free graphs (Q2686134) (← links)
- Local neighbor-distinguishing index of graphs (Q2693079) (← links)
- Legally $$(\varDelta +2)$$ ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time (Q3467875) (← links)
- (Q6188237) (← links)