Finding the edge ranking number through vertex partitions
From MaRDI portal
Publication:1949112
DOI10.1016/j.dam.2012.10.012zbMath1263.05032OpenAlexW1993344379MaRDI QIDQ1949112
Yue-Li Wang, Justie Su-Tzu Juan, Yo-Lin Lin
Publication date: 25 April 2013
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.10.012
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items
A survey and classification of Sierpiński-type graphs ⋮ Feedback vertex number of Sierpiński-type graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Coloring Hanoi and Sierpiński graphs
- On an edge ranking problem of trees and graphs
- Vertex-, edge-, and total-colorings of Sierpiński-like graphs
- Optimal node ranking of trees
- On a graph partition problem with application to VLSI layout
- Finding minimum height elimination trees for interval graphs in polynomial time
- Edge ranking of graphs is hard
- Algorithms for generalized vertex-rankings of partial k-trees
- Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
- Optimal node ranking of tree in linear time
- Optimal edge ranking of trees in polynomial time
- Ordered colourings
- On the vertex ranking problem for trapezoid, circular-arc and other graphs
- A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs
- Codes and \(L(2,1)\)-labelings in Sierpiński graphs
- Edge ranking of weighted trees
- The Role of Elimination Trees in Sparse Factorization
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Rankings of Graphs
- Pascal's Triangle and the Tower of Hanoi
- Optimal edge ranking of trees in linear time
