Path-Partition Structures of Graphs and Digraphs
From MaRDI portal
Publication:4052167
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)