The hub number of co-comparability graphs
From MaRDI portal
Publication:2514123
DOI10.1016/j.tcs.2014.12.011zbMath1306.05182OpenAlexW2003996037MaRDI QIDQ2514123
Jia-Jie Liu, Cindy Tzu-Hsin Wang, William Chung-Kung Yen, Yue-Li Wang
Publication date: 30 January 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.12.011
Cites Work
- Unnamed Item
- Unnamed Item
- The hub number of Sierpiński-like graphs
- Trapezoid graphs and generalizations, geometry and algorithms
- Efficient algorithms for the minimum connected domination on trapezoid graphs
- The hub number of a graph
- Counting the number of vertex covers in a trapezoid graph
- Routing sets in the integer lattice
- Trapezoid graphs and their coloring
- On powers of \(m\)-trapezoid graphs
- Connected domination and dominating clique in trapezoid graphs
- The connected hub number and the connected domination number
- Domination on Cocomparability Graphs