On the public citation graph
On Essentially 4-Edge-Connected Cubic Bricks
0 signed · 33 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.1002/jgt.21882openalex-snapshot
K4‐free and ‐free Planar Matching Covered Graphs
inferredcites →https://doi.org/10.1006/jctb.2000.2025openalex-snapshot
A Characterisation of Pfaffian Near Bipartite Graphs
inferredcites →https://doi.org/10.1006/jctb.2001.2091openalex-snapshot
On a Conjecture of Lovász Concerning Bricks
inferredcites →https://doi.org/10.1007/bf02579233openalex-snapshot
Brick decompositions and the matching rank of graphs
inferredcites →https://doi.org/10.1007/bf02579346openalex-snapshot
Ear-decompositions of matching-covered graphs
inferredcites →https://doi.org/10.1007/bfb0102696openalex-snapshot
Classifying K-connected cubic graphs
inferredcites →https://doi.org/10.1016/0095-8956(75)90048-9openalex-snapshot
A characterization of convertible (0, 1)-matrices
inferredcites →https://doi.org/10.1016/0095-8956(87)90021-9openalex-snapshot
Matching structure and the matching lattice
inferredcites →https://doi.org/10.1016/j.dam.2012.07.018openalex-snapshot
House of Graphs: A database of interesting graphs
inferredcites →https://doi.org/10.1016/j.endm.2008.01.030openalex-snapshot
A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs
inferredcites →https://doi.org/10.1016/j.jctb.2004.08.003openalex-snapshot
The perfect matching polytope and solid bricks
inferredcites →https://doi.org/10.1016/j.jctb.2007.12.005openalex-snapshot
Minimally non-Pfaffian graphs
inferredcites →https://doi.org/10.1017/s1446788700032730openalex-snapshot
Operations preserving the pfaffian property of a graph
inferredcites →https://doi.org/10.1063/1.1703953openalex-snapshot
Dimer Statistics and Phase Transitions
inferredcites →https://doi.org/10.1112/jlms/s1-22.2.107openalex-snapshot
The Factorization of Linear Graphs
inferredcites →https://doi.org/10.1137/080723843openalex-snapshot
A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs
inferredcites →https://doi.org/10.1137/17m1138704openalex-snapshot
On Two Unsolved Problems Concerning Matching Covered Graphs
inferredcites →https://doi.org/10.2307/121059openalex-snapshot
Permanents, Pfaffian Orientations, and Even Directed Circuits
inferredcites →https://doi.org/10.37236/8945openalex-snapshot
$b$-Invariant Edges in Essentially 4-Edge-Connected Near-Bipartite Cubic Bricks
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.22570openalex-snapshot
A characterization of nonfeasible sets in matching covered graphs
inferred← citeshttps://doi.org/10.1002/jgt.23173openalex-snapshot
Removable edges in near‐bipartite bricks
inferred← citeshttps://doi.org/10.1002/jgt.70078openalex-snapshot
b‐Invariant Edges in Near‐Bipartite Bricks
inferred← citeshttps://doi.org/10.1007/s00373-024-02769-6openalex-snapshot
Removable Edges in Claw-Free Bricks
inferred← citeshttps://doi.org/10.1016/j.dam.2025.02.045openalex-snapshot
Claw-free minimal matching covered graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112876openalex-snapshot
On cycle-nice claw-free graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2024.113948openalex-snapshot
Extremal spectral radius and essential edge-connectivity
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114553openalex-snapshot
Nice vertices in cubic graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103832openalex-snapshot
Some snarks are worse than others
inferred← citeshttps://doi.org/10.1142/s0219265921420111openalex-snapshot
A Note on Connectivity of a Cubic Graph
inferred← citeshttps://doi.org/10.37236/8945openalex-snapshot
$b$-Invariant Edges in Essentially 4-Edge-Connected Near-Bipartite Cubic Bricks
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.