On König graphs with respect to P4

DOI10.1134/S1990478917030139zbMath1399.05134OpenAlexW2750836845MaRDI QIDQ5374003

Dmitrii Mokeev

Publication date: 6 April 2018

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478917030139

zbMATH Keywords

4-pathKönig graphpacking of subgraphsvertex covering of subgraphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (4)

On the König graphs for a 5-path and its spanning supergraphs ⋮ A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs ⋮ König Graphs with Respect to the 4-Path and Its Spanning Supergraphs ⋮ On partial descriptions of König graphs for odd paths and all their spanning supergraphs

Cites Work

• König graphs for 3-paths and 3-cycles
• Combinatorial and computational aspects of graph packing and graph decomposition
• Complement reducible graphs
• Packing cycles in graphs. II
• On easy and hard hereditary classes of graphs with respect to the independent set problem
• Threshold graphs and related topics
• The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem
• Classes of graphs critical for the edge list-ranking problem
• König Graphs for 4-Paths
• Paths, Trees, and Flowers
• On the completeness of a generalized matching problem
• Unnamed Item
• Unnamed Item

This page was built for publication: On König graphs with respect to P4