Path-Partition Structures of Graphs and Digraphs

DOI10.1112/PLMS/S3-29.4.750zbMATH Open0298.05134OpenAlexW1987774734MaRDI QIDQ4052167FDOQ4052167

Authors: Colin 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

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

Cited In (7)

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

This page was built for publication: Path-Partition Structures of Graphs and Digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4052167)