On the public citation graph

On the line-connectivity of line-graphs

https://doi.org/10.1007/bf01396460
0 signed · 18 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4612-2972-8_4openalex-snapshot
Congruent Graphs and the Connectivity of Graphs
inferredcites →https://doi.org/10.1007/bf01350320openalex-snapshot
The connectivity of line-graphs
inferredcites →https://doi.org/10.1090/coll/038openalex-snapshot
Theory of Graphs
inferredcites →https://doi.org/10.2307/2371086openalex-snapshot
Congruent Graphs and the Connectivity of 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.3190030410openalex-snapshot
Graphs with prescribed connectivity and line graph connectivity
inferred← citeshttps://doi.org/10.1002/jgt.3190060214openalex-snapshot
The connectivities of line and total graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-81386-4_6openalex-snapshot
Connectivity of Line Graphs
inferred← citeshttps://doi.org/10.1007/bf01419429openalex-snapshot
On the connectivity of total graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(76)90037-6openalex-snapshot
Traversability and connectivity of the middle graph of a graph
inferred← citeshttps://doi.org/10.1016/j.dam.2007.04.003openalex-snapshot
A sufficient condition for Pk -path graphs being r-connected
inferred← citeshttps://doi.org/10.1016/j.disc.2004.05.007openalex-snapshot
Edge-connectivity in Pk -path graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.06.035openalex-snapshot
Maximally edge-connected and vertex-connected graphs and digraphs: A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112920openalex-snapshot
Index of parameters of iterated line graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00828-2openalex-snapshot
Edge-connectivity and super edge-connectivity of P2-path graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00029-5openalex-snapshot
On the line graphs of the complete r-partite graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00120-3openalex-snapshot
Cyclic and cliquewise connectedness of line graphs
inferred← citeshttps://doi.org/10.2139/ssrn.6102552openalex-snapshot
Optimal connectivity of second order iterated line graphs
inferred← citeshttps://doi.org/10.5036/bfsiu1968.7.47openalex-snapshot
On the Connectivities of the Generalized Line, Middle and Total Graph
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.