König Graphs for 4-Paths

DOI10.1007/978-3-319-09758-9_8MaRDI QIDQ5265220zbMATH OpenOpenAlexFDO

Authors D. B. Mokeev

Publication date 23 July 2015

Published in Models, Algorithms and Technologies for Network Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-09758-9_8

zbMATH Keywords

König-Egervary graph

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Paths and cycles (05C38)

Recommendations

• König graphs with respect to the 4-path and its spanning supergraphs
• On König graphs with respect to \(P_4\)
• scientific article; zbMATH DE number 6460013
• König graphs for 3-paths and 3-cycles
• 4-chromatic Koester graphs
• On \(K_4'\)-graphs
• Decomposition of the Kneser graph into paths of length four
• 4-path graphs: a generalization of line graphs
• Domination in 4-regular Knödel graphs
• Path cover in \({K_{1,4}}\)-free graphs

Cited in

(4)

• On the König graphs for a 5-path and its spanning supergraphs
• On König graphs with respect to \(P_4\)
• König graphs with respect to the 4-path and its spanning supergraphs
• König graphs for 3-paths and 3-cycles

This page was built for publication: König Graphs for 4-Paths

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