Path-Partition Structures of Graphs and Digraphs

DOI10.1112/plms/s3-29.4.750zbMath0298.05134OpenAlexW1987774734MaRDI QIDQ4052167

Colin J. H. McDiarmid

Publication date: 1974

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/plms/s3-29.4.750

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20)

Related Items

Walks, partitions, and normal ordering, Rado's theorem for polymatroids, Recent results on the total chromatic number, An upper bound for total colouring of graphs, Bi-submodular functions, distributive valuations, and distance functions in lattices, Some characterization theorems for circuit spaces associated with graphs, A new upper bound for total colourings of graphs