scientific article; zbMATH DE number 3404271
From MaRDI portal
Publication:5670652
Cited in
(17)- Path covering problems and testing of printed circuits
- Decomposition of graphs into paths and cycles
- Induced graphoidal decompositions in product graphs
- Induced label graphoidal graphs
- An algorithm to cyclic path covering number
- scientific article; zbMATH DE number 3717365 (Why is no real title available?)
- Tree cover number and maximum semidefinite nullity of some graph classes
- Decomposing graphs into internally-disjoint induced paths
- Graph theory (algorithmic, algebraic, and metric problems)
- Difference Labeling and Decomposition
- Characterisation of trees with exactly one diametral path
- Polynomial-time algorithms for \textsc{Path Cover} on trees and graphs of bounded treewidth
- Equitable path decomposition of graphs
- Decomposition of graphs into geodesic paths
- Covering and partitioning of split, chain and cographs with isometric paths
- NP-completeness of some problems of partitioning and covering in graphs
- Three ways to cover a graph
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5670652)
