scientific article

zbMath1350.05079MaRDI QIDQ2827796

Peng Li, Yaokun Wu

Publication date: 21 October 2016

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2526.1.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

fault tolerancegraph powerinterval representationscattering numberpath cover numberChvátal-Erdős theoremforward degree sequencelocal spanning cut functionnormal path algorithmrooted path systemspanning fan connectivityspanning rail connectivity

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (11)

A simple linear time algorithm to solve the MIST problem on interval graphs ⋮ Characterization of interval graphs that are unpaired 2-disjoint path coverable ⋮ Disjoint path covers joining prescribed source and sink sets in interval graphs ⋮ A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs ⋮ Torus-like graphs and their paired many-to-many disjoint path covers ⋮ The longest cycle problem is polynomial on interval graphs ⋮ Generalizations of the classics to spanning connectedness ⋮ Mathematical properties on the hyperbolicity of interval graphs ⋮ A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs ⋮ Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs ⋮ Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs

This page was built for publication: