scientific article; zbMATH DE number 3796005

zbMath0505.05052MaRDI QIDQ4740601

Ján Plesník

Publication date: 1982

Full work available at URL: https://eudml.org/doc/34139

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

factorNP- hardnessdiameter decomposition problemradius decomposition problem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Related Items

Graph factors and factorization: 1985--2003: a survey, Combinatorial analysis (nonnegative matrices, algorithmic problems)

Cites Work

• Distances in orientations of graphs
• On maximally distant spanning trees of a graph
• Factorizing the complete graph into factors with large star number
• On the factorization of the complete graph
• Disjoint factors of diameter two in complete graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• On a conjecture of bollobás and bosák
• Decomposition of Complete Graphs into Isomorphic Factors with a Given Diameter
• On the factorisation of the complete graph into factors of diameter 2
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item