Cycle‐Continuous Mappings—Order Structure

DOI10.1002/JGT.22047zbMath1365.05154arXiv1212.6909OpenAlexW2915215554MaRDI QIDQ5272633

Robert Šámal

Publication date: 30 June 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

cyclebridgeless graphpartial orderPetersen graphnowhere-zero flowscycle-continuous

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Flows in graphs (05C21)

Related Items (6)

Unnamed Item ⋮ Critical and flow-critical snarks coincide ⋮ Measures of edge-uncolorability of cubic graphs ⋮ Universality of intervals of line graph order ⋮ S_12 and P_12-colorings of cubic graphs ⋮ Morphology of small snarks

Uses Software

• House of Graphs

Cites Work

• Tension continuous maps -- their structure and applications
• Universality of intervals of line graph order
• House of Graphs: a database of interesting graphs
• On tension-continuous mappings
• Circuit Double Cover of Graphs
• On Graphic-Minimal Spaces
• Polyhedral decompositions of cubic graphs
• Finite paths are universal

This page was built for publication: Cycle‐Continuous Mappings—Order Structure