On the Problems of <inline-formula><math display="inline"><semantics><mi mathvariant="bold-script">CF</mi></semantics></math></inline-formula>-Connected Graphs for <i>K<sub>l,m,n</sub></i>

A connected graph, <i>G</i>, is <i>Crossing Free</i>-connected (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi mathvariant="script">CF</mi></semantics></math...

Full description

Bibliographic Details
Main Authors: Michal Staš, Mária Timková
Format: Article
Language:English
Published: MDPI AG 2024-07-01
Series:Mathematics
Subjects:
Online Access:https://www.mdpi.com/2227-7390/12/13/2068