Pages that link to "Item:Q3082946"

The following pages link to Graph Coloring and the Immersion Order (Q3082946):

Displaying 23 items.

• Coloring immersion-free graphs (Q326817) (← links)
• A minimum degree condition forcing complete graph immersion (Q397072) (← links)
• The structure of graphs not admitting a fixed immersion (Q473098) (← links)
• Complete graph immersions in dense graphs (Q512586) (← links)
• On clique immersions in line graphs (Q2005686) (← links)
• Clique immersions in graphs of independence number two with certain forbidden subgraphs (Q2022152) (← links)
• Immersion and clustered coloring (Q2099417) (← links)
• Large immersions in graphs with independence number 3 and 4 (Q2132349) (← links)
• Clique immersion in graphs without a fixed bipartite graph (Q2171024) (← links)
• Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs (Q2419108) (← links)
• Characterizing graphs of small carving-width (Q2446832) (← links)
• A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three (Q2668021) (← links)
• Clique immersions and independence number (Q2674557) (← links)
• Constructing graphs with no immersion of large complete graphs (Q2922213) (← links)
• (Q5079746) (← links)
• (Q5743487) (← links)
• Systematic Refinement of Abstract State Machines with Higher-Order Logic (Q5881450) (← links)
• Forcing clique immersions through chromatic number (Q5892297) (← links)
• Clique immersion in graph products (Q6041549) (← links)
• Totally odd immersions in line graphs (Q6117353) (← links)
• Biclique immersions in graphs with independence number 2 (Q6612311) (← links)
• A note on the immersion number of generalized Mycielski graphs (Q6616828) (← links)
• A note on clique immersion of strong product graphs (Q6635105) (← links)