scientific article; zbMATH DE number 3813532
From MaRDI portal
Publication:3661495
Cited in
(12)- Covering orthogonal polygons with star polygons: The perfect graph approach
- Working with Lowell
- Increasing stability with complexity in a system composed of unstable subsystems
- An eulerian trail traversing specified edges in given order
- A connection between a convex programming problem and the LYM property on perfect graphs
- On Colouring Partial Joins of a Complete Graph and a Cycle
- Clique-transversal sets of line graphs and complements of line graphs
- Bipartite and Eulerian minors
- A solution to a colouring problem of P. Erdős
- Construction of large‐size interconnection networks with high performance
- Which crossing number is it anyway?
- The crossing number of locally twisted cubes \(L T Q_n\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3661495)