The neighbour-scattering number can be computed in polynomial time for interval graphs

DOI10.1016/J.CAMWA.2007.02.006zbMath1155.05329arXivcs/0603069OpenAlexW2068734246MaRDI QIDQ1005803

Fengwei Li, Xue Liang Li

Publication date: 10 March 2009

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0603069

zbMATH Keywords

interval graphconsecutive clique arrangementneighbour-scattering number

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (1)

Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time

Cites Work

• Optimal K-secure graphs
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Incidence matrices and interval graphs
• On Maximal Circuits in Finite Graphs
• A Characterization of Comparability Graphs and of Interval Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The neighbour-scattering number can be computed in polynomial time for interval graphs