|
Given a graph G=(V,E), we give a characterization of the existence of two subgraphs s.t. if we take the degrees of a node in these subgraphs, their difference falls in a given interval.
Bibtex entry:
| AUTHOR | = | {B{\'e}rczi, Krist{\'o}f}, |
| TITLE | = | {Subgraphs with restricted degree differences}, |
| NOTE | = | {{\tt egres.elte.hu}}, |
| INSTITUTION | = | {Egerv{\'a}ry Research Group, Budapest}, |
| YEAR | = | {2011}, |
| NUMBER | = | {QP-2011-04} |