On embedding graphs with bounded sum of size and maximum degree

DOI10.1016/J.DISC.2014.04.001MaRDI QIDQ2017040zbMATHOpenAlexFDO

Authors Andrzej Żak

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

zbMATH Keywords

embedding graphspacking graphssubgraphs of self-complementary graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Vertex degrees (05C07) Structural characterization of families of graphs (05C75)

Recommendations

• On a conjecture of embeddable graphs
• Embedding graphs of small size
• A note on uniquely embeddable graphs
• Embedding Arbitrary Graphs of Maximum Degree Two
• Packing two copies of a sparse graph into a graph with restrained maximum degree

Cites work

• scientific article; zbMATH DE number 1022391 (Why is no real title available?)
• A note on packing graphs without cycles of length up to five
• Edge disjoint placement of graphs
• Embedding (p,p - 1) graphs in their complements
• Embedding graphs in their complements
• Every (p,p-2) graph is contained in its complement
• Fixed-point-free embeddings of graphs in their complements
• On packable digraphs
• On self‐complementation
• Packings of graphs and applications to computational complexity
• Sparse graphs of girth at least five are packable

Cited in

(4)

• ON BOUNDS FOR BALANCED EMBEDDING DEGREE
• All trees are 1-embeddable and all except stars are 2-embeddable
• EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS
• Overlaying a hypergraph with a graph with bounded maximum degree

This page was built for publication: On embedding graphs with bounded sum of size and maximum degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017040)