Graph Coloring and the Immersion Order
From MaRDI portal
Publication:3082946
DOI10.1007/3-540-45071-8_40zbMath1276.05042OpenAlexW1573336533MaRDI QIDQ3082946
Faisal N. Abu-Khzam, Michael A. Langston
Publication date: 18 March 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-45071-8_40
Related Items (20)
Systematic Refinement of Abstract State Machines with Higher-Order Logic ⋮ 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 ⋮ A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three ⋮ Clique immersions and independence number ⋮ A minimum degree condition forcing complete graph immersion ⋮ Clique immersion in graph products ⋮ Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs ⋮ Totally odd immersions in line graphs ⋮ Characterizing graphs of small carving-width ⋮ Forcing clique immersions through chromatic number ⋮ The structure of graphs not admitting a fixed immersion ⋮ Complete graph immersions in dense graphs ⋮ On clique immersions in line graphs ⋮ Unnamed Item ⋮ Clique immersions in graphs of independence number two with certain forbidden subgraphs ⋮ Immersion and clustered coloring ⋮ Unnamed Item
This page was built for publication: Graph Coloring and the Immersion Order
