Cut-through connections of graphs

DOI10.37193/CJM.2025.02.12MaRDI QIDQ6963256zbMATH OpenFDO

Authors Daniela Matisova, Juraj Valiska

Publication date 7 July 2025

Published in Carpathian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37193/CJM.2025.02.12

zbMATH Keywords

\(\mathcal{P}\)-connectioncut-through trailGauss codeknot

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Cites work

• A classification of generic curves on oriented surfaces
• Coloring graphs to produce properly colored walks
• Conflict-free connections of graphs
• Eulerian straight ahead cycles in drawings of complete bipartite graphs
• Graph theory
• Graphs with conflict-free connection number two
• Graphs with rainbow connection number two
• scientific article; zbMATH DE number 5090 (Why is no real title available?)
• On conflict-free connection of graphs
• On proper-path colorings in graphs
• On realizability of Gauss diagrams and constructions of meanders
• Proper connection and size of graphs
• Proper connection number of random graphs
• Proper connection of graphs
• Rainbow connection in graphs
• Rainbow connection in graphs with minimum degree three
• Rainbow connection number of dense graphs
• Rainbow connection of random regular graphs
• Rainbow connection of sparse random graphs
• Rainbow connections of graphs
• Rainbow connections of graphs: a survey
• Some remarks on rainbow connectivity
• Straight-ahead walks in Eulerian graphs
• Über kombinatorische Topologie

Cited in

(1)

• On anti-A-connectivity in plane graphs

This page was built for publication: Cut-through connections of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6963256)