On self-complementary cyclic packing of forests
type: Item
instance of: scholarly article
title: On self-complementary cyclic packing of forests
zbMATH Open document ID: 1182.05100
author: Mariusz Woźniak
author: Adam Paweł Wojda
author: Irmina A. Zioło
published in: The Electronic Journal of Combinatorics
publication date: 2009-04-07T00:00:00Z
full work available at URL: https://eudml.org/doc/117185
full work available at URL: v14i1r62.html
review text: Summary: A graph is self-complementary if it is isomorphic to its complement. In this paper we prove that every forest of order \(4p\) and size less than \(3p\) is a subgraph of a self-complementary graph of order \(4p\) with a cyclic self-complementary permutation. We also discuss some generalization of the main result.
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 5540840
zbMATH Keywords: self-complemetary graphs
zbMATH Keywords: forest
zbMATH Keywords: cyclic self-complementary permutation
MaRDI profile type: Publication
Recommended article: On cyclic packing of a tree
Recommended article: Packing two forests into a bipartite graph
Recommended article: Packing trees in complete graphs
Recommended article: On the Tree Packing Conjecture
Recommended article: Q4325294
Recommended article: Packing trees in complete bipartite graphs
Recommended article: The cyclic sieving phenomenon for non-crossing forests
Recommended article: On packing trees into complete bipartite graphs
Recommended article: On maximal independent arborescence packing
Recommended article: Integral packing of trees and branchings
description: scientific article; zbMATH DE number 5540840