On the public citation graph
On Halin graphs
0 signed · 30 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00977745openalex-snapshot
Minimum dominating cycles in outerplanar graphs
inferredcites →https://doi.org/10.1016/0012-365x(79)90060-8openalex-snapshot
Characterizations of outerplanar graphs
inferredcites →https://doi.org/10.1016/0304-3975(82)90133-5openalex-snapshot
The subgraph isomorphism problem for outerplanar graphs
inferredcites →https://doi.org/10.1112/plms/s3-30.2.160openalex-snapshot
On a Family of Planar Bicritical Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.10111openalex-snapshot
Minimum cycle bases of Halin graphs
inferred← citeshttps://doi.org/10.1007/3-540-17218-1_56openalex-snapshot
On some generalizations of outerplanar graphs: Results and open problems
inferred← citeshttps://doi.org/10.1007/3-540-18740-5_36openalex-snapshot
Fast parallel algorithms for optimal edge-colouring of some tree-structured graphs
inferred← citeshttps://doi.org/10.1007/3-540-51859-2_21openalex-snapshot
Optimal parallel computations for halin graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-30347-0_4openalex-snapshot
The Vulcan Game of Kal-Toh: Finding or Making Triconnected Planar Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-45567-4_25openalex-snapshot
On Two Problems Related to the Traveling Salesman Problem on Halin Graphs
inferred← citeshttps://doi.org/10.1007/s00454-018-0009-xopenalex-snapshot
Small Universal Point Sets for k-Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/s10878-021-00731-3openalex-snapshot
Intersections and circuits in sets of line segments
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90080-4openalex-snapshot
Parallel O(log n) time edge-colouring of trees and Halin graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(87)90031-xopenalex-snapshot
Steiner problem in Halin networks
inferred← citeshttps://doi.org/10.1016/0166-218x(88)90126-6openalex-snapshot
The binding number of Halin graphs
inferred← citeshttps://doi.org/10.1016/0895-7177(88)90483-9openalex-snapshot
On the galactic number of a hypercube
inferred← citeshttps://doi.org/10.1016/j.dam.2014.05.008openalex-snapshot
Characterization of minimum cycle basis in weighted partial 2-trees
inferred← citeshttps://doi.org/10.1016/j.jpdc.2020.03.016openalex-snapshot
A distributed algorithm for a maximal 2-packing set in Halin graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.11.038openalex-snapshot
On minimum average stretch spanning trees in polygonal 2-trees
inferred← citeshttps://doi.org/10.1142/s0219265923500330openalex-snapshot
On the Local Metric Dimension of Graphs
inferred← citeshttps://doi.org/10.1142/s0219265925500124openalex-snapshot
The Monitoring-Edge-Geodetic Number of Some Planar Networks
inferred← citeshttps://doi.org/10.1142/s1793830918500052openalex-snapshot
Listing all spanning trees in Halin graphs — sequential and Parallel view
inferred← citeshttps://doi.org/10.1142/s1793830920500378openalex-snapshot
Edge version of metric dimension for the families of grid graphs and generalized prism graphs
inferred← citeshttps://doi.org/10.1145/3149.3154openalex-snapshot
The traveling salesman problem in graphs with 3-edge cutsets
inferred← citeshttps://doi.org/10.3390/math6110243openalex-snapshot
Edge Version of Metric Dimension and Doubly Resolving Sets of the Necklace Graph
inferred← citeshttps://doi.org/10.4153/cmb-2009-045-6openalex-snapshot
Hamiltonian Properties of Generalized Halin Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1401.0432openalex-snapshot
On Minimum Average Stretch Spanning Trees in Polygonal 2-trees
inferred← citeshttps://doi.org/10.48550/arxiv.1808.07176openalex-snapshot
Intersections, circuits, and colorability of line segments
inferred← citeshttps://doi.org/10.7155/jgaa.00604openalex-snapshot
Drawing Halin-graphs with small height
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.