Forcing clique immersions through chromatic number
From MaRDI portal
Publication:5892297
DOI10.1016/j.endm.2016.09.022zbMath1356.05052arXiv1703.08235OpenAlexW2535255037WikidataQ127893243 ScholiaQ127893243MaRDI QIDQ5892297
Tien-Nam Le, Paul Wollan, Gregory Gauthier
Publication date: 13 February 2017
Published in: Electronic Notes in Discrete Mathematics, European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.08235
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (8)
Clique immersion in graphs without a fixed bipartite graph ⋮ A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three ⋮ Clique immersions and independence number ⋮ Clique immersion in graph products ⋮ Forcing clique immersions through chromatic number ⋮ On clique immersions in line graphs ⋮ Clique immersions in graphs of independence number two with certain forbidden subgraphs ⋮ Immersion and clustered coloring
Cites Work
- Unnamed Item
- Unnamed Item
- A minimum degree condition forcing complete graph immersion
- The structure of graphs not admitting a fixed immersion
- Complete graph immersions in dense graphs
- Lower bound of the Hadwiger number of graphs by their average degree
- Graph minors XXIII. Nash-Williams' immersion conjecture
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- Graph Coloring and the Immersion Order
- Immersing small complete graphs
- An extremal function for contractions of graphs
- On Hadwiger's Number and the Stability Number
- Complete graph immersions and minimum degree
- On a special case of Hadwiger's conjecture
- Forcing clique immersions through chromatic number
This page was built for publication: Forcing clique immersions through chromatic number
