scientific article; zbMATH DE number 6963893

zbMath1459.05316MaRDI QIDQ4691777

V. V. Lepin

Publication date: 24 October 2018

Full work available at URL: http://mathnet.ru/eng/timb7

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple linear-time algorithm for finding path-decompositions of small width
• An optimal parallel solution for the path cover problem on \(P_{4}\)-sparse graphs
• Linear algorithm for optimal path cover problem on interval graphs
• Complement reducible graphs
• Optimal covering of cacti by vertex-disjoint paths
• The vertex separation number of a graph equals its path-width
• On a class of posets and the corresponding comparability graphs
• Minimum node disjoint path covering for circular-arc graphs
• Optimal path cover problem on block graphs and bipartite permutation graphs
• The path-partition problem in bipartite distance-hereditary graphs
• The path-partition problem in block graphs
• \(k\)-path partitions in trees
• On the \(k\)-path partition of graphs.
• HAMILTONian circuits in chordal bipartite graphs
• Optimal path cover problem on block graphs
• On the \(k\)-path cover problem for cacti
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Cardinality constrained path covering problems in grid graphs
• Graph minors. II. Algorithmic aspects of tree-width
• The Planar Hamiltonian Circuit Problem is NP-Complete
• The $L(2,1)$-Labeling Problem on Graphs
• Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

This page was built for publication: