Tension continuous maps -- their structure and applications
From MaRDI portal
Publication:427807
DOI10.1016/j.ejc.2011.11.005zbMath1243.05228arXivmath/0503360MaRDI QIDQ427807
Robert Šámal, Jaroslav Nešetřil
Publication date: 18 June 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0503360
05C80: Random graphs (graph-theoretic aspects)
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
05C55: Generalized Ramsey theory
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Cycle‐Continuous Mappings—Order Structure, Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities, On tension-continuous mappings, Flow-continuous mappings -- the influence of the group, Fractional covering by cuts
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey on flows in graphs and matroids
- On the minimum order of graphs with given semigroup
- Homomorphisms and edge-colourings of planar graphs
- On the complexity of H-coloring
- Chromatically optimal rigid graphs
- Color-families are dense
- Simple proof of the existence of restricted Ramsey graphs by means of a partite construction
- On edge semi-isomorphisms and semi-dualities of graphs
- On the injective chromatic number of graphs
- Duality theorems for finite structures (characterising gaps and good characterisations)
- Matroidal bijections between graphs
- On tension-continuous mappings
- High-girth cubic graphs are homomorphic to the Clebsch graph
- On Graphic-Minimal Spaces
- Congruent Graphs and the Connectivity of Graphs
- 2-Isomorphic Graphs
- Computer Science Logic
- The random graph