On tension-continuous mappings

DOI10.1016/j.ejc.2007.11.023zbMath1183.05050arXivmath/0602563OpenAlexW1979555945MaRDI QIDQ2427549

Jaroslav Nešetřil, Robert Šámal

Publication date: 13 May 2008

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0602563

zbMATH Keywords

homotens graphstension-continuousTT mappings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Perfect graphs (05C17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Flows in graphs (05C21)

Related Items

Cores of cubelike graphs, The core of a complementary prism, Tension continuous maps -- their structure and applications, Flow-continuous mappings -- the influence of the group, Unnamed Item, Variations on the Petersen colouring conjecture, High-girth cubic graphs are homomorphic to the Clebsch graph, A surprising permanence of old motivations (a not-so-rigid story), Cycle‐Continuous Mappings—Order Structure

Cites Work

• Tension continuous maps -- their structure and applications
• On the minimum order of graphs with given semigroup
• The strong perfect graph theorem
• The chromatic connectivity of graphs
• On sparse graphs with given colorings and homomorphisms.
• On the injective chromatic number of graphs
• Duality theorems for finite structures (characterising gaps and good characterisations)
• Matroidal bijections between graphs
• Homomorphisms of derivative graphs
• K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
• On Graphic-Minimal Spaces
• Congruent Graphs and the Connectivity of Graphs
• The chromatic covering number of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item