Characterizing acyclic graphs by labeling edges
From MaRDI portal
Publication:2448884
DOI10.1016/j.dam.2013.06.019zbMath1288.05236OpenAlexW2030612572MaRDI QIDQ2448884
Abilio Lucena, Sebastián Urrutia
Publication date: 5 May 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.06.019
Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Unnamed Item
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- Integer Programming Formulation of Traveling Salesman Problems
- The probabilistic minimum spanning tree problem
- The complexity of the capacitated tree problem
- Community structure in social and biological networks
- Matroids and the greedy algorithm
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs