Compuational complexity of the Krausz dimension of graphs

DOI10.1007/BFB0024500MaRDI QIDQ4373683zbMATH OpenFDO

Authors Petr Hliněný, Jan Kratochvíl

Publication date 11 June 1998

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

Full work available at URL https://doi.org/10.1007/BFB0024500

zbMATH Keywords

Krausz partition

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Krausz dimension and its generalizations in special graph classes
• scientific article; zbMATH DE number 5054160
• The Krausz decomposition in special classes of split graphs
• Helly dimension of line graphs of k-uniform hypergraphs
• scientific article; zbMATH DE number 992948

Cited in

(8)

• Helly dimension of line graphs of k-uniform hypergraphs
• A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of threshold graphs
• The Krausz decomposition in special classes of split graphs
• scientific article; zbMATH DE number 5054160 (Why is no real title available?)
• Krausz dimension and its generalizations in special graph classes
• Edge intersection graphs of linear 3-uniform hypergraphs
• Edge intersection graphs of linear 3-uniform hypergraphs
• \((k-2)\)-linear connected components in hypergraphs of rank \(k\)

This page was built for publication: Compuational complexity of the Krausz dimension of graphs

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