Fixed-point-free embeddings of graphs in their complements

DOI10.1155/S0161171278000356zbMath0391.05047MaRDI QIDQ1251240

Seymour Schuster

Publication date: 1978

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

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

zbMATH Keywords

ComplementsFixed-Point-Free Embeddings of GraphsIsomorphic Embedding

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99)

Related Items (8)

Embedding graphs of small size ⋮ A list version of graph packing ⋮ Fixed-point-free embeddings of digraphs with small size ⋮ Packing of graphs and permutations -- a survey ⋮ Sparse graphs of girth at least five are packable ⋮ On embedding graphs with bounded sum of size and maximum degree ⋮ Embedding (p,p - 1) graphs in their complements ⋮ Labeled 2-packings of trees

This page was built for publication: Fixed-point-free embeddings of graphs in their complements