Embedding of graphs in two-irregular graphs

DOI10.1002/1097-0118(200102)36:2%3C75::AID-JGT3%3E3.0.CO;2-EMaRDI QIDQ2707975zbMATH OpenOpenAlexFDO

Authors Maria Axenovich, Zoltán Füredi

Publication date 11 December 2002

Full work available at URL https://doi.org/10.1002/1097-0118(200102)36:2%3C75::aid-jgt3%3E3.0.co;2-e

zbMATH Keywords

degree sequenceembeddingpacking

Mathematics Subject Classification ID

Vertex degrees (05C07) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• scientific article; zbMATH DE number 15356
• scientific article; zbMATH DE number 683300
• scientific article; zbMATH DE number 2060804
• Embedding Arbitrary Graphs of Maximum Degree Two
• Regularizing irregular graphs

Cites work

• Edge disjoint placement of graphs
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• Triple placement of graphs

Cited in

(6)

• Irregular embeddings of hypergraphs with fixed chromatic number
• Irregular embeddings of multigraphs with fixed chromatic number
• scientific article; zbMATH DE number 4156463 (Why is no real title available?)
• scientific article; zbMATH DE number 15356 (Why is no real title available?)
• scientific article; zbMATH DE number 2060804 (Why is no real title available?)
• Irregular subgraphs

This page was built for publication: Embedding of graphs in two-irregular graphs

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