On Critical Unicyclic Graphs with Cutwidth Four
The cutwidth minimization problem consists of finding an arrangement of the vertices of a graph <i>G</i> on a line <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mi>P</mi><mi&g...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-11-01
|
| Series: | AppliedMath |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2673-9909/2/4/36 |