Immersing small complete graphs
From MaRDI portal
Publication:3085021
DOI10.26493/1855-3974.112.b74zbMath1213.05137OpenAlexW2164875551WikidataQ129352318 ScholiaQ129352318MaRDI QIDQ3085021
Haruko Okamura, Ken-ichi Kawarabayashi, Bojan Mohar, Matt DeVos
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
Related Items
Large immersions in graphs with independence number 3 and 4, Coloring immersion-free graphs, Constructing Graphs with No Immersion of Large Complete Graphs, Clique immersion in graphs without a fixed bipartite graph, Forbidding Kuratowski Graphs as Immersions, Clique immersions and independence number, A minimum degree condition forcing complete graph immersion, Immersing complete digraphs, Forcing clique immersions through chromatic number, The structure of graphs not admitting a fixed immersion, A note on immersion minors and planarity, Complete graph immersions in dense graphs, On clique immersions in line graphs, Clique immersions in graphs of independence number two with certain forbidden subgraphs, Hadwiger’s Conjecture, On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion, Immersion and clustered coloring, Unnamed Item
