(p,q)-odd digraphs

DOI<175::AID-JGT8>3.0.CO;2-Q 10.1002/(SICI)1097-0118(199610)23:2<175::AID-JGT8>3.0.CO;2-QzbMath0859.05047OpenAlexW4230559597MaRDI QIDQ4894620

Anna Galluccio, Martin Loebl

Publication date: 7 April 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199610)23:2<175::aid-jgt8>3.0.co;2-q

zbMATH Keywords

latticedigraphcharacterizationsubdivisionconnectivitydirected cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Graph bases and diagram commutativity ⋮ Ear decomposition for pair comparison data ⋮ The enumeration of planar graphs via Wick's theorem ⋮ Cycle bases for lattices of binary matroids with no Fano dual minor and their one-element extensions

This page was built for publication: (p,q)-odd digraphs