On the public citation graph
The chromatic class of a multigraph
0 signed · 182 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.1112/jlms/s1-27.1.85openalex-snapshot
A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
inferredcites →https://doi.org/10.1112/jlms/s1-32.4.456openalex-snapshot
Maximal Circuits in Critical Graphs
inferredcites →https://doi.org/10.1112/jlms/s1-38.1.423openalex-snapshot
Regular Graphs with Given Girth and Restricted Circuits
inferredcites →https://doi.org/10.1112/plms/s3-2.1.69openalex-snapshot
Some Theorems on Abstract Graphs
inferredcites →https://doi.org/10.1112/plms/s3-7.1.161openalex-snapshot
A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
inferredcites →https://doi.org/10.1112/s0025579300003041openalex-snapshot
An extension of a theorem of König on graphs
inferredcites →https://doi.org/10.2307/2372652openalex-snapshot
Paths and Circuits in Critical Graphs
inferredcites →https://doi.org/10.4064/fm-40-1-42-55openalex-snapshot
The structure of k-chromatic 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/(sici)1097-0118(199912)32:4<311::aid-jgt1>3.0.co;2-xopenalex-snapshot
Improved bounds for the chromatic index of graphs and multigraphs
inferred← citeshttps://doi.org/10.1002/ecjc.4430720206openalex-snapshot
Upper bounds for the fg‐chromatic index of graphs
inferred← citeshttps://doi.org/10.1002/jgt.20571openalex-snapshot
On characterizing Vizing's edge colouring bound
inferred← citeshttps://doi.org/10.1002/jgt.21759openalex-snapshot
Interval Non‐edge‐Colorable Bipartite Graphs and Multigraphs
inferred← citeshttps://doi.org/10.1002/jgt.22135openalex-snapshot
Vizing's 2‐Factor Conjecture Involving Large Maximum Degree
inferred← citeshttps://doi.org/10.1002/jgt.22494openalex-snapshot
Ring graphs and Goldberg's bound on chromatic index
inferred← citeshttps://doi.org/10.1002/jgt.22825openalex-snapshot
Independence number of edge‐chromatic critical graphs
inferred← citeshttps://doi.org/10.1002/jgt.22903openalex-snapshot
Double Vizing fans in critical class two graphs
inferred← citeshttps://doi.org/10.1002/jgt.23069openalex-snapshot
Overfullness of edge‐critical graphs with small minimal core degree
inferred← citeshttps://doi.org/10.1002/jgt.23155openalex-snapshot
Local version of Vizing's theorem for multigraphs
inferred← citeshttps://doi.org/10.1002/jgt.3190010112openalex-snapshot
Definitions of criticality with respect to edge‐coloring
inferred← citeshttps://doi.org/10.1002/jgt.3190020202openalex-snapshot
A bibliographic survey of edge‐colorings
inferred← citeshttps://doi.org/10.1002/jgt.3190080115openalex-snapshot
Edge‐coloring of multigraphs: Recoloring technique
inferred← citeshttps://doi.org/10.1002/jgt.3190100202openalex-snapshot
A generalization of edge‐coloring in graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190170104openalex-snapshot
Edge‐chromatic critical graphs and the existence of 1‐factors
inferred← citeshttps://doi.org/10.1002/net.20190openalex-snapshot
Some results about f‐critical graphs
inferred← citeshttps://doi.org/10.1002/net.3230230203openalex-snapshot
Graph endpoint coloring and distributed processing
inferred← citeshttps://doi.org/10.1006/jctb.1996.0067openalex-snapshot
Asymptotics of the Chromatic Index for Multigraphs
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_48openalex-snapshot
Scheduling file transfers under port and channel constraints
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_16openalex-snapshot
The Graph Coloring Problem: A Bibliographic Survey
inferred← citeshttps://doi.org/10.1007/978-3-030-63072-0_3openalex-snapshot
Total Chromatic Sum for Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-59835-7_24openalex-snapshot
Polynomial Algorithms to Minimize 2/3-Submodular Functions
inferred← citeshttps://doi.org/10.1007/978-94-011-5678-3_17openalex-snapshot
Some Optimization Problems of Scheduling the Transmission of Messages in a Local Communication Network
inferred← citeshttps://doi.org/10.1007/bf01093595openalex-snapshot
The chromatic class and the location of a graph on a closed surface
inferred← citeshttps://doi.org/10.1007/bfb0059422openalex-snapshot
Graphical theorems of the Nordhaus-Gaddum class
inferred← citeshttps://doi.org/10.1007/bfb0070378openalex-snapshot
On the chromatic index and the cover index of a multigraph
inferred← citeshttps://doi.org/10.1007/bfb0070415openalex-snapshot
Edge-colorings of graphs — A survey
inferred← citeshttps://doi.org/10.1007/s00224-020-10013-wopenalex-snapshot
On the Complexity of the Smallest Grammar Problem over Fixed Alphabets
inferred← citeshttps://doi.org/10.1007/s00373-003-0540-1openalex-snapshot
Vertex Colouring and Forbidden Subgraphs ? A Survey
inferred← citeshttps://doi.org/10.1007/s00373-010-0888-yopenalex-snapshot
Set-coloring of Edges and Multigraph Ramsey Numbers
inferred← citeshttps://doi.org/10.1007/s00373-012-1278-4openalex-snapshot
A Larger Family of Planar Graphs that Satisfy the Total Coloring Conjecture
inferred← citeshttps://doi.org/10.1007/s00373-016-1698-7openalex-snapshot
Hamiltonian Cycles in Critical Graphs with Large Maximum Degree
inferred← citeshttps://doi.org/10.1007/s00373-016-1720-0openalex-snapshot
Total Colorings of Graphs with Minimum Sum of Colors
inferred← citeshttps://doi.org/10.1007/s00373-020-02263-9openalex-snapshot
On Generalisations of the AVD Conjecture to Digraphs
inferred← citeshttps://doi.org/10.1007/s00500-020-05344-2openalex-snapshot
Zero-divisor graphs and total coloring conjecture
inferred← citeshttps://doi.org/10.1007/s10107-026-02327-3openalex-snapshot
Weakly polynomial-time algorithms to minimize 2/3-submodular functions
inferred← citeshttps://doi.org/10.1007/s10586-016-0686-2openalex-snapshot
Energy aware scheduling model and online heuristics for stencil codes on heterogeneous computing architectures
inferred← citeshttps://doi.org/10.1007/s11067-024-09661-zopenalex-snapshot
A Backtracking Algorithm for Solving the Nearly Equitable Strong Edge-coloring Problem on Transportation Network
inferred← citeshttps://doi.org/10.1007/s11464-016-0613-0openalex-snapshot
Chromatic number and subtrees of graphs
inferred← citeshttps://doi.org/10.1007/s13226-023-00500-4openalex-snapshot
Total coloring of graphs associated with algebraic structures and ordered structures
inferred← citeshttps://doi.org/10.1016/0012-365x(81)90227-2openalex-snapshot
On graphs critical with respect to edge-colourings
inferred← citeshttps://doi.org/10.1016/0012-365x(83)90043-2openalex-snapshot
Some applications of Vizing's theorem to vertex colorings of graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(83)90074-2openalex-snapshot
The chromatic index of graphs with large maximum degree
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90078-5openalex-snapshot
A new method of proving theorems on chromatic index
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90142-7openalex-snapshot
Some parameters of graph and its complement
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90203-3openalex-snapshot
Applications of edge coloring of multigraphs to vertex coloring of graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90400-vopenalex-snapshot
Relations between parameters of a graph
inferred← citeshttps://doi.org/10.1016/0095-8956(77)90039-9openalex-snapshot
On the chromatic index of almost all graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(81)90030-7openalex-snapshot
Construction of class 2 graphs with maximum vertex degree 3
inferred← citeshttps://doi.org/10.1016/0095-8956(84)90022-4openalex-snapshot
On the chromatic index of multigraphs without large triangles
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50005-1openalex-snapshot
10.1016/b978-044488002-4/50005-1
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50046-4openalex-snapshot
10.1016/b978-044488002-4/50046-4
inferred← citeshttps://doi.org/10.1016/j.commtr.2023.100108openalex-snapshot
An ADMM-based parallel algorithm for solving traffic assignment problem with elastic demand
inferred← citeshttps://doi.org/10.1016/j.cor.2022.105732openalex-snapshot
Complexity and approximation of open shop scheduling to minimize the makespan: A review of models and approaches
inferred← citeshttps://doi.org/10.1016/j.dam.2010.06.012openalex-snapshot
A generalization of interval edge-colorings of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2013.09.025openalex-snapshot
On sum edge-coloring of regular, bipartite and split graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2014.07.006openalex-snapshot
Strong edge-colouring of sparse planar graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.04.005openalex-snapshot
Further results on the deficiency of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.10.026openalex-snapshot
Terminal-pairability in complete bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.12.003openalex-snapshot
Cyclic deficiency of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2020.12.003openalex-snapshot
The terminal-pairability problem in complete bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.06.012openalex-snapshot
Compositions, decompositions, and conformability for total coloring on power of cycle graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2023.01.008openalex-snapshot
Vizing’s adjacency lemma on edge chromatic critical signed graphs and its applications
inferred← citeshttps://doi.org/10.1016/j.dam.2023.09.032openalex-snapshot
Gap one bounds for the equitable chromatic number of block graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2026.02.009openalex-snapshot
Block graphs — Some general results and their equitable colorings
inferred← citeshttps://doi.org/10.1016/j.disc.2006.04.016openalex-snapshot
A note on total colourings of digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.048openalex-snapshot
The average degree of an edge-chromatic critical graph
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.017openalex-snapshot
The edge version of Hadwiger’s conjecture
inferred← citeshttps://doi.org/10.1016/j.disc.2008.04.023openalex-snapshot
Achieving maximum chromatic index in multigraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2008.04.046openalex-snapshot
On Vizing’s bound for the chromatic index of a multigraph
inferred← citeshttps://doi.org/10.1016/j.disc.2008.06.019openalex-snapshot
An application of Vizing and Vizing-like adjacency lemmas to Vizing’s Independence Number Conjecture of edge chromatic critical graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2009.04.016openalex-snapshot
Research Problems from the BCC21
inferred← citeshttps://doi.org/10.1016/j.disc.2009.11.011openalex-snapshot
The average degree of a multigraph critical with respect to edge or total choosability
inferred← citeshttps://doi.org/10.1016/j.disc.2010.02.001openalex-snapshot
Interval edge-colorings of complete graphs and n -dimensional cubes
inferred← citeshttps://doi.org/10.1016/j.disc.2010.02.007openalex-snapshot
On disjoint matchings in cubic graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2014.01.014openalex-snapshot
A characterization of hypergraphs that achieve equality in the Chvátal–McDiarmid Theorem
inferred← citeshttps://doi.org/10.1016/j.disc.2014.02.021openalex-snapshot
A new tool for proving Vizing’s Theorem
inferred← citeshttps://doi.org/10.1016/j.disc.2015.10.034openalex-snapshot
Independence in 5-uniform hypergraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2016.01.023openalex-snapshot
Interval cyclic edge-colorings of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2016.04.002openalex-snapshot
Interval edge-colorings of complete graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2016.11.022openalex-snapshot
An introduction to the discharging method via graph coloring
inferred← citeshttps://doi.org/10.1016/j.disc.2017.07.013openalex-snapshot
Hamiltonicity of edge chromatic critical graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2018.11.005openalex-snapshot
A note on chromatic number of (cap, even hole)-free graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112902openalex-snapshot
An improvement to the Hilton-Zhao vertex-splitting conjecture
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113610openalex-snapshot
Decomposition of class II graphs into two class I graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114804openalex-snapshot
Resistance, oddness and colouring defect of snarks
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103690openalex-snapshot
On the chromatic edge stability index of graphs
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.08.065openalex-snapshot
Even-power of Cycles With Many Vertices are Type 1 Total Colorable
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.04.006openalex-snapshot
Overfullness of critical class 2 graphs with a small core degree
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.08.001openalex-snapshot
Chromatic index of dense quasirandom graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.10.005openalex-snapshot
On Vizing's edge colouring question
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.10.010openalex-snapshot
Edge-colouring graphs with local list sizes
inferred← citeshttps://doi.org/10.1016/j.tcs.2002.10.002openalex-snapshot
Note on the game chromatic index of trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.12.007openalex-snapshot
Terminal-pairability in complete bipartite graphs with non-bipartite demands
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115126openalex-snapshot
Fast and simple (1 + ε)Δ-edge-coloring of dense graphs
inferred← citeshttps://doi.org/10.1016/j.tre.2024.103687openalex-snapshot
A novel parallel computing framework for traffic assignment problem: Integrating alternating direction method of multipliers with Jacobi over relaxation method
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00230-8openalex-snapshot
A further extension of Yap's construction for Δ-critical graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00086-6openalex-snapshot
On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(99)00361-1openalex-snapshot
A refinement of Vizing's theorem
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00128-5openalex-snapshot
Characterizing and edge-colouring split-indifference graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70303-0openalex-snapshot
Applications of Edge Coloring of Multigraphs to Vertex Coloring of Graphs
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72891-3openalex-snapshot
Embedding Totally Symmetric Quasigroups
inferred← citeshttps://doi.org/10.1017/s030500410005129xopenalex-snapshot
Some remarks on a paper by Vizing on critical graphs
inferred← citeshttps://doi.org/10.1017/s0963548397003210openalex-snapshot
List Total Colourings of Graphs
inferred← citeshttps://doi.org/10.1070/rm1968v023n06abeh001252openalex-snapshot
SOME UNSOLVED PROBLEMS IN GRAPH THEORY
inferred← citeshttps://doi.org/10.1080/00029890.1976.11994058openalex-snapshot
Three Conjectures on Critical Graphs
inferred← citeshttps://doi.org/10.1103/physrevresearch.3.033207openalex-snapshot
Low overhead universality and quantum supremacy using only Z control
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00107openalex-snapshot
A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects
inferred← citeshttps://doi.org/10.1109/qcnc64685.2025.00016openalex-snapshot
Phantom Edges in the Problem Hamiltonian: A Method for Increasing Performance and Graph Visibility for QAOA
inferred← citeshttps://doi.org/10.1109/tcomm.2024.3409198openalex-snapshot
Beyond TIN: GDoF of K-User Interference Channel With Successive Interference Cancellation and Power Control
inferred← citeshttps://doi.org/10.1112/jlms/jdm117openalex-snapshot
1‐factorization of regular graphs by colour exchange
inferred← citeshttps://doi.org/10.1112/jlms/s2-44.3.393openalex-snapshot
Regular Multigraphs of High Degree are 1-Factorizable
inferred← citeshttps://doi.org/10.1137/20m1385615openalex-snapshot
List Coloring of Two Matroids through Reduction to Partition Matroids
inferred← citeshttps://doi.org/10.1137/24m1636253openalex-snapshot
Supermodular Extension of Vizing’s Edge-Coloring Theorem
inferred← citeshttps://doi.org/10.1145/2897518.2897568openalex-snapshot
New deterministic approximation algorithms for fully dynamic matching
inferred← citeshttps://doi.org/10.1145/3717823.3718265openalex-snapshot
Vizing’s Theorem in Near-Linear Time
inferred← citeshttps://doi.org/10.11650/tjm.14.2010.393openalex-snapshot
SOME CONSEQUENCES OF A THEOREM ON FANS
inferred← citeshttps://doi.org/10.11650/twjm/1500405726openalex-snapshot
SOME CONSEQUENCES OF A THEOREM ON FANS
inferred← citeshttps://doi.org/10.1360/n012015-00261openalex-snapshot
A note on induced subtrees and chromatic number of graphs
inferred← citeshttps://doi.org/10.14778/3836663.3836664openalex-snapshot
EcoTable: Cost-Effective Table Integration in Data Lakes for Natural Language Queries
inferred← citeshttps://doi.org/10.1613/jair.1.13768openalex-snapshot
Classical Planning in Deep Latent Space
inferred← citeshttps://doi.org/10.18297/etd/815openalex-snapshot
A study of the total coloring of graphs.
inferred← citeshttps://doi.org/10.2139/ssrn.5413142openalex-snapshot
Drawing and Scheduling the UEFA Champions League League Phase
inferred← citeshttps://doi.org/10.22214/ijraset.2019.4278openalex-snapshot
Graph coloring Parameters-A Survey
inferred← citeshttps://doi.org/10.24963/ijcai.2020/371openalex-snapshot
Learning Neural-Symbolic Descriptive Planning Models via Cube-Space Priors: The Voyage Home (to STRIPS)
inferred← citeshttps://doi.org/10.26493/1855-3974.981.ff0openalex-snapshot
Improving upper bounds for the distinguishing index
inferred← citeshttps://doi.org/10.26493/2590-9770.1472.24bopenalex-snapshot
Distinguishing arc-colourings of symmetric digraphs
inferred← citeshttps://doi.org/10.2989/16073606.2022.2053605openalex-snapshot
A note on reducing resistance in snarks
inferred← citeshttps://doi.org/10.33915/etd.1602openalex-snapshot
Edge coloring of simple graphs and edge -face coloring of simple plane graphs
inferred← citeshttps://doi.org/10.37236/10898openalex-snapshot
Coloring, List Coloring, and Painting Squares of Graphs (and Other Related Problems)
inferred← citeshttps://doi.org/10.37236/6848openalex-snapshot
Measures of Edge-Uncolorability of Cubic Graphs
inferred← citeshttps://doi.org/10.37236/7353openalex-snapshot
Vizing's 2-Factor Conjecture Involving Toughness and Maximum Degree Conditions
inferred← citeshttps://doi.org/10.4153/cmb-2012-046-3openalex-snapshot
The f-Chromatic Index of a Graph Whose f-Core Has Maximum Degree 2
inferred← citeshttps://doi.org/10.4171/8ecm/11openalex-snapshot
Graph and hypergraph colouring via nibble methods: A survey
inferred← citeshttps://doi.org/10.4236/ojdm.2017.74018openalex-snapshot
Cyclically Interval Total Colorings of Cycles and Middle Graphs of Cycles
inferred← citeshttps://doi.org/10.4236/ojdm.2018.83006openalex-snapshot
Cyclically Interval Total Coloring of the One Point Union of Cycles
inferred← citeshttps://doi.org/10.46991/pysu:a/2017.51.1.022openalex-snapshot
DEFICIENCY OF OUTERPLANAR GRAPHS
inferred← citeshttps://doi.org/10.48550/arxiv.1211.5311openalex-snapshot
Interval colorings of complete balanced multipartite graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1301.3811openalex-snapshot
Interval non-edge-colorable bipartite graphs and multigraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1411.5661openalex-snapshot
Interval edge-colorings of complete graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1501.04296openalex-snapshot
The f-Chromatic Index of Claw-free Graphs Whose f-Core is 2-regular
inferred← citeshttps://doi.org/10.48550/arxiv.1608.00904openalex-snapshot
Further results on the deficiency of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1702.07156openalex-snapshot
On measures of edge-uncolorability of cubic graphs: A brief survey and some new results
inferred← citeshttps://doi.org/10.48550/arxiv.2004.01848openalex-snapshot
Bounds Related to The Edge-List Chromatic and Total Chromatic Numbers of a Simple Graph
inferred← citeshttps://doi.org/10.48550/arxiv.2103.05171openalex-snapshot
An improvement to the vertex-splitting conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.2107.11706openalex-snapshot
Total Difference Labeling of Regular Infinite Graphs
inferred← citeshttps://doi.org/10.5753/etc.2026.23621openalex-snapshot
Coloração Total de Grafos Linha de Grafos Completos
inferred← citeshttps://doi.org/10.5817/cz.muni.eurocomb23-102openalex-snapshot
Vizing's edge-recoloring conjecture holds.
inferred← citeshttps://doi.org/10.5860/choice.39-4018openalex-snapshot
Combinatorial optimization: packing and covering
inferred← citeshttps://doi.org/10.70675/79b52188zb0a0z489az82e6zcdec747b6b39openalex-snapshot
Combinatorial and Algorithmic aspects of Reconfiguration
inferred← citeshttps://doi.org/10.70675/c814ebb8z1ca3z4fe3z80a4zbb3feeadbfe7openalex-snapshot
Graph Coloring and Recoloring
inferred← citeshttps://doi.org/10.7151/dmgt.2467openalex-snapshot
Resistance in regular class two graphs
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.