Graph orientations with edge-connection and parity constraints

DOI10.1007/s004930200003zbMath0989.05099OpenAlexW1984188921MaRDI QIDQ1603262

Zoltán Király, András Frank

Publication date: 25 June 2002

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930200003

zbMATH Keywords

connectivityorientation

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items (7)

On constructive characterizations of \((k,l)\)-sparse graphs ⋮ Constructive characterizations for packing and covering with trees ⋮ Compatible geometric matchings ⋮ The constructive characterization of \((k,l)\)-edge-connected digraphs ⋮ Tree-compositions and orientations ⋮ Brick partitions of graphs ⋮ The edge-orientation problem and some of its variants on weighted graphs

This page was built for publication: Graph orientations with edge-connection and parity constraints