On embedding graphs with bounded sum of size and maximum degree
From MaRDI portal
Publication:2017040
DOI10.1016/j.disc.2014.04.001zbMath1295.05159OpenAlexW2058956860MaRDI QIDQ2017040
Publication date: 25 June 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.04.001
Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Edge disjoint placement of graphs
- Embedding (p,p - 1) graphs in their complements
- Packings of graphs and applications to computational complexity
- Fixed-point-free embeddings of graphs in their complements
- Sparse graphs of girth at least five are packable
- A note on packing graphs without cycles of length up to five
- On self‐complementation
- Embedding graphs in their complements
- Every (p,p-2) graph is contained in its complement
- On Packable Digraphs
This page was built for publication: On embedding graphs with bounded sum of size and maximum degree