Immersing small complete graphs

DOI10.26493/1855-3974.112.B74MaRDI QIDQ3085021zbMATH OpenOpenAlexWikidataFDO

Authors Matt DeVos, Ken-ichi Kawarabayashi, Bojan Mohar, Haruko Okamura

Publication date 28 March 2011

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.26493/1855-3974.112.b74

zbMATH Keywords

Hadwiger conjectureimmersion

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph minors (05C83)

Recommendations

• Complete graph immersions in dense graphs
• Embedding graphs of small size
• Immersions in highly edge connected graphs
• A minimum degree condition forcing complete graph immersion
• Constructing graphs with no immersion of large complete graphs
• Complete graph immersions and minimum degree
• scientific article; zbMATH DE number 3857140
• Immersing complete digraphs
• Embedding digraphs of small size
• Decomposition of complete graphs into small graphs

Cited in

(26)

• A note on immersion minors and planarity
• On clique immersions in line graphs
• Clique immersions in graphs of independence number two with certain forbidden subgraphs
• Immersion and clustered coloring
• Large immersions in graphs with independence number 3 and 4
• Clique immersion in graphs without a fixed bipartite graph
• Clique immersions and independence number
• Hadwiger's conjecture
• Constructing graphs with no immersion of large complete graphs
• Forbidding Kuratowski graphs as immersions
• Coloring immersion-free graphs
• scientific article; zbMATH DE number 4104981 (Why is no real title available?)
• A minimum degree condition forcing complete graph immersion
• Immersing complete digraphs
• Complete graph immersions and minimum degree
• The structure of graphs not admitting a fixed immersion
• Complete graph immersions in dense graphs
• Immersion containment and connectivity in color-critical graphs
• List-coloring graphs without subdivisions and without immersions
• On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion
• Totally odd immersions in line graphs
• Immersion of complete digraphs in Eulerian digraphs
• Biclique immersions in graphs with independence number 2
• Complete bipartite immersion in graphs with independence number two: a simple proof
• Biclique immersions in graphs with independence number 2 (extended abstract)
• Immersions and Albertson's conjecture

This page was built for publication: Immersing small complete graphs

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