Covering planar graphs with forests, one having bounded maximum degree

Overview of attention for article published in Journal of Combinatorial Theory - Series B, March 2009

Altmetric Badge

Mentioned by

wikipedia: 4 Wikipedia pages

Readers on

mendeley: 18 Mendeley

So far, Altmetric has seen 4 citations on 4 Wikipedia pages.

Ukrainian

(a, b)-розклад

Cited by user Lxlalexlxl on 21 Apr 2023

(a, b)-Розклад неорієнтованого графа - це розбиття ребер на a + 1 множин, кожна з яких представляє ліс, за винятком однієї, степінь якої не перевищує b.

Russian

(a, b)-разложение

Cited by user Jumpow on 17 Dec 2017

Hungarian

(a, b)-felbontás

Cited by user Syp on 25 Sep 2017

English

(a,b)-decomposability

Cited by user El Charpi on 01 Dec 2014

In graph theory, the (a, b)-decomposability of an undirected graph is the existence of a partition of its edges into a + 1 sets, each one of them inducing a forest…

This page shows the most recent Wikipedia articles that mention this research output. Click here to find out how to access more activity.