scientific article; zbMATH DE number 3547322
From MaRDI portal
Publication:4121921
Cited in
(24)- The subgraph isomorphism problem for outerplanar graphs
- Interior graphs of maximal outerplane graphs
- Planar orientations with low out-degree and compaction of adjacency matrices
- Characterizations of outerplanar graphs
- Algorithms and outerplanar conditions for A-trails in plane Eulerian graphs
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size
- Computing volumes of adjacency polytopes via Draconian sequences
- Facial anagram-free edge-coloring of plane graphs
- Non-greedy online Steiner trees on outerplanar graphs
- The structure of sandpile groups of outerplanar graphs
- Non-greedy online Steiner trees on outerplanar graphs
- Facial non-repetitive edge-coloring of plane graphs
- Facial parity 9-edge-coloring of outerplane graphs
- WORM colorings of planar graphs
- Spanning tree congestion of k-outerplanar graphs
- \(B_0\)-VPG representation of AT-free outerplanar graphs
- Conservative trees
- B0-VPG Representation of AT-free Outerplanar Graphs
- On semistrong edge-colorings of outerplanar graphs
- Computing eternal vertex cover number of maximal outerplanar graphs in linear time
- The rainbow number of cycles in maximal outerplanar graphs
- Proximity and radius in outerplanar graphs with bounded faces
- A new lower bound of the rainbow number of cycles in maximal outerplanar graphs
- The interval number of a planar graph: Three intervals suffice
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 Q4121921)