A note on \(k\)-placeable graphs (Q409394): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Packings of graphs and applications to computational complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Every (p,p-2) graph is contained in its complement / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the packing of three graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Edge disjoint placement of graphs / rank | |||
Normal rank | |||
Latest revision as of 02:22, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on \(k\)-placeable graphs |
scientific article |
Statements
A note on \(k\)-placeable graphs (English)
0 references
13 April 2012
0 references
packing graph
0 references
\(k\)-placement
0 references
edge disjoint
0 references
