scientific article; zbMATH DE number 1796979

zbMath0993.05133MaRDI QIDQ4551374

Ning Zhong, Dingjun Lou

Publication date: 5 September 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2108/21080349

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

zbMATH Keywords

bicritical graphshighly efficient algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs ⋮ Graphs with no \(M\)-alternating path between two vertices

This page was built for publication: