Premium
Maximum directed cuts in digraphs with degree restriction
Author(s) -
Lehel Jenö,
Maffray Frédéric,
Preissmann Myriam
Publication year - 2009
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20374
Subject(s) - combinatorics , mathematics , vertex (graph theory) , directed graph , graph , degree (music) , strongly connected component , discrete mathematics , digraph , physics , acoustics
For integers m, k ≥1, we investigate the maximum size of a directed cut in directed graphs in which there are m edges and each vertex has either indegree at most k or outdegree at most k . © 2009 Wiley Periodicals, Inc. J Graph Theory
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom