A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (Q288235): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(8 intermediate revisions by 7 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s10898-015-0360-x / rank | |||
Property / author | |||
Property / author: Wei Fan Wang / rank | |||
Property / author | |||
Property / author: Yi Qiao Wang / rank | |||
Property / author | |||
Property / author: Wei Fan Wang / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Yi Qiao Wang / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6584561 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
breadth first search | |||
Property / zbMATH Keywords: breadth first search / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
tree | |||
Property / zbMATH Keywords: tree / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
outerplanar graph | |||
Property / zbMATH Keywords: outerplanar graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
edge coloring | |||
Property / zbMATH Keywords: edge coloring / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
2-distance vertex-distinguishing index | |||
Property / zbMATH Keywords: 2-distance vertex-distinguishing index / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10898-015-0360-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1851117818 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(r\)-strong edge colorings of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Adjacent Vertex Distinguishing Edge‐Colorings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the vertex-distinguishing proper edge-colorings of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vertex-distinguishing proper edge-colorings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(L(h,1)\)-labeling subclasses of planar graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5545841 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3651735 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Neighbor-Distinguishing Index of Planar Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(d\)-strong edge colorings of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The surviving rate of an outerplanar graph for the firefighter problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some bounds on the neighbor-distinguishing index of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Adjacent strong edge coloring of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5294976 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S10898-015-0360-X / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 13:30, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs |
scientific article |
Statements
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (English)
0 references
25 May 2016
0 references
breadth first search
0 references
tree
0 references
outerplanar graph
0 references
edge coloring
0 references
2-distance vertex-distinguishing index
0 references
0 references