Hamiltonian circuits and path coverings of vertices in graphs

DOI10.4064/CM-30-2-295-316zbMATH Open0291.05110OpenAlexW876312943MaRDI QIDQ4041608FDOQ4041608

Authors: Zdzisław Skupień 

Publication date: 1974

Published in: Colloquium Mathematicum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/cm-30-2-295-316

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited In (11)

• Title not available (Why is that?)
• Relating path coverings to vertex labellings with a condition at distance two
• Path partition for graphs with special blocks
• \(k\)-path partitions in trees
• Hamiltonian path saturated graphs with small size
• Path coverings of the vertices of a tree
• Completion and deficiency problems
• On a class of posets and the corresponding comparability graphs
• Path partition number in tough graphs
• The path-partition problem in block graphs
• On the \(k\)-path partition of graphs.

This page was built for publication: Hamiltonian circuits and path coverings of vertices in graphs

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