Edge clique partition of K _4-free and planar graphs

DOI10.1007/978-3-642-24983-9_9MaRDI QIDQ3098071zbMATH OpenOpenAlexFDO

Authors Rudolf Fleischer, Xiaotian Wu

Publication date 11 November 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-24983-9_9

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Edge clique partition in \((k,\ell)\)-graphs
• Publication:4734765
• Partition into cliques for cubic graphs: Planar case, complexity and approximation
• A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number
• Clique and anticlique partitions of graphs

Cited in

(9)

• Partition into cliques for cubic graphs: Planar case, complexity and approximation
• scientific article; zbMATH DE number 1472140 (Why is no real title available?)
• Path partitioning planar graphs of girth 4 without adjacent short cycles
• Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
• Edge clique partition in \((k,\ell)\)-graphs
• Weighted 2-sections and hypergraph reconstruction
• Constrained representations of map graphs and half-squares
• scientific article; zbMATH DE number 7764108 (Why is no real title available?)
• A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number

This page was built for publication: Edge clique partition of \(K _{4}\)-free and planar graphs

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