Arankings of trees

DOI10.7151/dmgt.2090zbMath1404.05098OpenAlexW2801391306WikidataQ129834530 ScholiaQ129834530MaRDI QIDQ1717194

D. Pillone

Publication date: 7 February 2019

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2090

zbMATH Keywords

coloringminimal ranking

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rank numbers of grid graphs
• Ordered colourings
• Incidence matrices and interval graphs
• Minimal rankings and the arank number of a path
• Minimal rankings of the Cartesian product K_{n}□ K_{m}
• The Role of Elimination Trees in Sparse Factorization
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
• Rankings of Graphs
• Minimal rankings

This page was built for publication: Arankings of trees