\(M_{2}\)-equipackable graphs (Q2499599): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 03:41, 3 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | \(M_{2}\)-equipackable graphs |
scientific article |
Statements
\(M_{2}\)-equipackable graphs (English)
0 references
14 August 2006
0 references
Let \(H\) be a fixed graph. An \(H\)-packing of \(G\) is a set of edge disjoint subgraphs of \(G\) each isomorphic to \(H\). An \(H\)-packing in \(G\) with \(k\) copies \(H_1,H_2,\dots,H_k\) of \(H\) is called maximal if \(G-\bigcup^k_{i=1}E(H_i)\) contains no subgraph isomorphic to \(H\). An \(H\)-packing in \(G\) with \(k\) copies \(H_1,H_2,\dots,H_k\) of \(H\) is called maximum if no more than \(k\) edge disjoint copies of \(H\) can be packed into \(G\). A graph \(G\) is called \(H\)-equipackable if every maximal \(H\)-packing in \(G\) is also a maximum \(H\)-packing in \(G\). By \(M_t\), \(t\geq 1\), we denote a matching having \(t\) edges. In this paper, we investigate the characterization of \(M_2\)-equipackable graphs.
0 references
packing
0 references
packable
0 references
randomly packable
0 references
equipackable
0 references
matching
0 references