On the public citation graph

Graph Colorings

https://doi.org/10.1090/conm/352
0 signed · 105 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 points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781119272182.ch4openalex-snapshot
Applications of High‐Fidelity Sequencing Protocol to RNA Viruses
inferred← citeshttps://doi.org/10.1002/net.21826openalex-snapshot
Integer programming formulations for minimum deficiency interval coloring
inferred← citeshttps://doi.org/10.1002/nla.779openalex-snapshot
A probing method for computing the diagonal of a matrix inverse
inferred← citeshttps://doi.org/10.1002/nme.2989openalex-snapshot
Assembly of finite element methods on graphics processors
inferred← citeshttps://doi.org/10.1007/11753810_87openalex-snapshot
Optimal Wavelength Converter Placement with Guaranteed Wavelength Usage
inferred← citeshttps://doi.org/10.1007/11780823_11openalex-snapshot
Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs
inferred← citeshttps://doi.org/10.1007/3-540-32392-9_31openalex-snapshot
Effects of Versatile Crossover and Mutation Operators on Evolutionary Search in Partition and Permutation Problems
inferred← citeshttps://doi.org/10.1007/3-540-34129-3_14openalex-snapshot
Distributed Collaboration: Services and Information Sources in a Knowledge-based Architecture
inferred← citeshttps://doi.org/10.1007/978-3-030-21803-4_37openalex-snapshot
An Experimental Comparison of Heuristic Coloring Algorithms in Terms of Found Color Classes on Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-64843-5_7openalex-snapshot
An Approximation of the Zero Error Capacity by a Greedy Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-031-69577-3_15openalex-snapshot
PriCE: Privacy-Preserving and Cost-Effective Scheduling for Parallelizing the Large Medical Image Processing Workflow over Hybrid Clouds
inferred← citeshttps://doi.org/10.1007/978-3-319-15585-2_9openalex-snapshot
An Ant Algorithm for the Partition Graph Coloring Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-45811-3_3openalex-snapshot
Perfect Graphs and Comparability Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-59776-8_29openalex-snapshot
Combining CP and ILP in a Tree Decomposition of Bounded Height for the Sum Colouring Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-59861-1_6openalex-snapshot
Solving Graph Partitioning Problems with Parallel Metaheuristics
inferred← citeshttps://doi.org/10.1007/978-3-540-68111-3_25openalex-snapshot
Parallel Simulated Annealing Algorithm for Graph Coloring Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-78985-7_7openalex-snapshot
Solving Scheduling Problems by Evolutionary Algorithms for Graph Coloring Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-03417-6_4openalex-snapshot
Experimental Study of Independent and Dominating Sets in Wireless Sensor Networks Using Graph Coloring Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-38016-7_2openalex-snapshot
Independent Set with Advice: The Impact of Graph Knowledge
inferred← citeshttps://doi.org/10.1007/978-981-95-5747-9_2openalex-snapshot
Graph Traversal Algorithms on GPU
inferred← citeshttps://doi.org/10.1007/s00025-021-01505-3openalex-snapshot
Consecutive Colouring of Oriented Graphs
inferred← citeshttps://doi.org/10.1007/s00211-023-01368-6openalex-snapshot
Computation of the von Neumann entropy of large matrices via trace estimators and rational Krylov methods
inferred← citeshttps://doi.org/10.1007/s00224-014-9592-2openalex-snapshot
Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s00373-022-02565-0openalex-snapshot
An Upper Bound for the 3-Tone Chromatic Number of Graphs with Maximum Degree 3
inferred← citeshttps://doi.org/10.1007/s10100-014-0345-8openalex-snapshot
Circular coloring of graphs via linear programming and tabu search
inferred← citeshttps://doi.org/10.1007/s10587-010-0067-6openalex-snapshot
A class of weakly perfect graphs
inferred← citeshttps://doi.org/10.1007/s10589-012-9496-5openalex-snapshot
Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
inferred← citeshttps://doi.org/10.1007/s10732-015-9288-zopenalex-snapshot
Hybrid evolutionary algorithm for the b-chromatic number
inferred← citeshttps://doi.org/10.1007/s10878-013-9699-4openalex-snapshot
An exact algorithm for the maximum probabilistic clique problem
inferred← citeshttps://doi.org/10.1007/s10878-021-00825-yopenalex-snapshot
On zero-error codes produced by greedy algorithms
inferred← citeshttps://doi.org/10.1007/s10922-015-9344-xopenalex-snapshot
JRCAP: A Joint Routing and Channel Assignment Protocol for Multi-radio Multi-channel IEEE 802.11s Mesh Networks
inferred← citeshttps://doi.org/10.1007/s10922-017-9422-3openalex-snapshot
TCLAB: A New Topology Control Protocol in Cognitive MANETs Based on Learning Automata
inferred← citeshttps://doi.org/10.1007/s40009-014-0256-1openalex-snapshot
Harmonious Coloring on Corona Product of Complete Graphs
inferred← citeshttps://doi.org/10.1007/s40009-019-00805-1openalex-snapshot
On Certain J-Colouring Parameters of Graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90204-5openalex-snapshot
Interval vertex-coloring of a graph with forbidden colors
inferred← citeshttps://doi.org/10.1017/s1431927614013464openalex-snapshot
Structure Identification in High-Resolution Transmission Electron Microscopic Images: An Example on Graphene
inferred← citeshttps://doi.org/10.1038/s42005-025-02089-yopenalex-snapshot
Graph coloring framework to mitigate cascading failure in complex networks
inferred← citeshttps://doi.org/10.1063/5.0071149openalex-snapshot
Computation of chromatic zagreb indices of nanotubes and nanotori
inferred← citeshttps://doi.org/10.1063/5.0222452openalex-snapshot
On b-coloring analysis and its application on STGNN for soil moisture, temperature and pH forecasting of companion farming
inferred← citeshttps://doi.org/10.1080/00207160.2013.847181openalex-snapshot
On equitable colouring of Knödel graphs
inferred← citeshttps://doi.org/10.1080/09720529.2014.995976openalex-snapshot
On Co-completek–partite Graph Valued Functions
inferred← citeshttps://doi.org/10.1080/17797179.2012.751782openalex-snapshot
Elastic foam compression in a finite element (FE) context
inferred← citeshttps://doi.org/10.1088/1757-899x/10/1/012009openalex-snapshot
Introduction to assembly of finite element methods on graphics processors
inferred← citeshttps://doi.org/10.1093/bioinformatics/btu295openalex-snapshot
Accurate viral population assembly from ultra-deep sequencing data
inferred← citeshttps://doi.org/10.1109/cais.2018.8441950openalex-snapshot
A Survey on Exam Scheduling Techniques
inferred← citeshttps://doi.org/10.1109/cicn.2011.22openalex-snapshot
Add-On to the ETS Algorithm to Improve Its Efficiency in Special Cases Such as a Crown Graph
inferred← citeshttps://doi.org/10.1109/clei64178.2024.10700277openalex-snapshot
IPOptimizer: A Tool to Optimize the Pull Request Integration Process
inferred← citeshttps://doi.org/10.1109/ebiss.2010.5473660openalex-snapshot
Design of a Software Watermarking Algorithm Based on Register Allocation
inferred← citeshttps://doi.org/10.1109/grc.2008.4664727openalex-snapshot
Multicoloring the Mycielskian of Graphs
inferred← citeshttps://doi.org/10.1109/iceccme64568.2025.11277505openalex-snapshot
A Constrained Multi-Objective Minimization Strategy for Distributed and Evasive TCP Port Scanning in Backbone Networks
inferred← citeshttps://doi.org/10.1109/icon.2012.6506558openalex-snapshot
Performances evaluation of different algorithms for PCIs self configuration in LTE
inferred← citeshttps://doi.org/10.1109/ipdps.2015.113openalex-snapshot
Balanced Coloring for Parallel Computing Applications
inferred← citeshttps://doi.org/10.1109/iscas.2010.5537955openalex-snapshot
A memory mapping approach for parallel interleaver design with multiples read and write accesses
inferred← citeshttps://doi.org/10.1109/itc50671.2022.00028openalex-snapshot
PPA Optimization of Test Points in Automotive Designs
inferred← citeshttps://doi.org/10.1109/itng.2009.15openalex-snapshot
Two New Algorithms for Software Watermarking by Register Allocation and their Empirical Evaluation
inferred← citeshttps://doi.org/10.1109/mspct.2013.6782143openalex-snapshot
The graph coloring problem — Review of algorithms & neural networks and a new proposal
inferred← citeshttps://doi.org/10.1109/ojcoms.2025.3540133openalex-snapshot
Faster Convergence With Less Communication: Broadcast-Based Subgraph Sampling for Decentralized Learning Over Wireless Networks
inferred← citeshttps://doi.org/10.1109/sde.2011.5952075openalex-snapshot
Using differential evolution for the graph coloring
inferred← citeshttps://doi.org/10.1109/services.2014.58openalex-snapshot
On Valid and Optimal Deployments for Mixed-Tenancy Problems in SaaS-Applications
inferred← citeshttps://doi.org/10.1109/synasc54541.2021.00043openalex-snapshot
Graphs hard-to-process for greedy algorithm MIN
inferred← citeshttps://doi.org/10.1109/tci.2020.3029385openalex-snapshot
Speckle Suppression in Multi-Channel Coherent Imaging: A Tractable Bayesian Approach
inferred← citeshttps://doi.org/10.1109/tit.2011.2119630openalex-snapshot
On Achieving Local View Capacity Via Maximal Independent Graph Scheduling
inferred← citeshttps://doi.org/10.1109/tmc.2012.157openalex-snapshot
Achieving User-Level Fairness in Open-Access Femtocell-Based Architecture
inferred← citeshttps://doi.org/10.1109/tnse.2020.3039494openalex-snapshot
Group-Based General Epidemic Modeling for Spreading Processes on Networks: GroupGEM
inferred← citeshttps://doi.org/10.1109/tpds.2016.2620142openalex-snapshot
Algorithms for Balanced Graph Colorings with Applications in Parallel Computing
inferred← citeshttps://doi.org/10.1109/tpds.2020.3014173openalex-snapshot
Feluca: A Two-Stage Graph Coloring Algorithm With Color-Centric Paradigm on GPU
inferred← citeshttps://doi.org/10.1109/wmnc.2011.6097251openalex-snapshot
Joint routing and channel assignment protocol for multi-radio multi-channel IEEE 802.11s mesh networks
inferred← citeshttps://doi.org/10.1137/24m165168xopenalex-snapshot
Surrogate Models for Vibrational Entropy Based on a Spatial Decomposition
inferred← citeshttps://doi.org/10.1137/s0036144504444711openalex-snapshot
What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
inferred← citeshttps://doi.org/10.1142/s0219265923500147openalex-snapshot
On δ(k)-Coloring of Some Cycle-Related Graphs
inferred← citeshttps://doi.org/10.1142/s0219265925500045openalex-snapshot
Equitable Dominator Coloring of Helm-Related Graphs
inferred← citeshttps://doi.org/10.1142/s0219498817501730openalex-snapshot
Coloring of a non-zero component graph associated with a finite dimensional vector space
inferred← citeshttps://doi.org/10.1142/s179383091650052xopenalex-snapshot
A study on the injective coloring parameters of certain graphs
inferred← citeshttps://doi.org/10.1142/s1793830917500148openalex-snapshot
On chromatic Zagreb indices of certain graphs
inferred← citeshttps://doi.org/10.1142/s1793830917500549openalex-snapshot
On certain parameters of equitable coloring of graphs
inferred← citeshttps://doi.org/10.1142/s1793830918500301openalex-snapshot
On certain coloring parameters of Mycielski graphs of some graphs
inferred← citeshttps://doi.org/10.1142/s1793830918500404openalex-snapshot
Equitable coloring parameters of certain graph classes
inferred← citeshttps://doi.org/10.1142/s1793830921500610openalex-snapshot
Chromatic Zagreb and irregularity polynomials of graphs
inferred← citeshttps://doi.org/10.1142/s1793830921500968openalex-snapshot
On δ(k)-coloring of generalized Petersen graphs
inferred← citeshttps://doi.org/10.1142/s1793830921501160openalex-snapshot
On δ(k)-coloring of powers of helm and closed helm graphs
inferred← citeshttps://doi.org/10.1145/2480362.2480525openalex-snapshot
CodeBlast
inferred← citeshttps://doi.org/10.1145/2593069.2593213openalex-snapshot
Selective Inversion of Inductance Matrix for Large-Scale Sparse RLC Simulation
inferred← citeshttps://doi.org/10.1145/2851488openalex-snapshot
WorkStream -- A Design Pattern for Multicore-Enabled Finite Element Computations
inferred← citeshttps://doi.org/10.1155/2011/279246openalex-snapshot
Equitable Coloring on Total Graph of Bigraphs and Central Graph of Cycles and Paths
inferred← citeshttps://doi.org/10.1186/s13634-015-0279-xopenalex-snapshot
Performance characterization and transmission schemes for instantly decodable network coding in wireless broadcast
inferred← citeshttps://doi.org/10.13189/ms.2024.120408openalex-snapshot
Incident Vertex Pi Coloring of Graph Families: Fan, Book, Gear, Windmill, Dutch Windmill and Crown Graph
inferred← citeshttps://doi.org/10.15439/2014f391openalex-snapshot
Solving Graph Coloring Problem with Parallel Evolutionary Algorithms in a Mesh Model
inferred← citeshttps://doi.org/10.22199/issn.0717-6279-2019-03-0030openalex-snapshot
Rainbow neighbourhood number of graphs
inferred← citeshttps://doi.org/10.22331/q-2021-01-20-385openalex-snapshot
Efficient quantum measurement of Pauli operators in the presence of finite sampling error
inferred← citeshttps://doi.org/10.2478/ausi-2019-0011openalex-snapshot
On J-colorability of certain derived graph classes
inferred← citeshttps://doi.org/10.2478/ausi-2019-0013openalex-snapshot
On some L(2, 1)-coloring parameters of certain graph classes
inferred← citeshttps://doi.org/10.26713/cma.v14i2.2215openalex-snapshot
Incident Vertex \(\pi\)-Coloring of Graphs
inferred← citeshttps://doi.org/10.28978/nesciences.379317openalex-snapshot
Relation between Center Coloring and the other Colorings
inferred← citeshttps://doi.org/10.31801/cfsuasmas.1108176openalex-snapshot
Chromatic Schultz polynomial of certain graphs
inferred← citeshttps://doi.org/10.3390/sym18050774openalex-snapshot
The Equitable Coloring of Circulant Graphs
inferred← citeshttps://doi.org/10.4018/978-1-4666-2661-4.ch009openalex-snapshot
Graph Coloring
inferred← citeshttps://doi.org/10.4018/978-1-5225-2857-9.ch004openalex-snapshot
Memetic Algorithms and Their Applications in Computer Science
inferred← citeshttps://doi.org/10.4018/978-1-5225-5204-8.ch060openalex-snapshot
Memetic Algorithms and Their Applications in Computer Science
inferred← citeshttps://doi.org/10.70675/03a33e82zc587z4a58z86c1zefe5d03c8af7openalex-snapshot
Decomposition and Domination of Some Graphs
inferred← citeshttps://doi.org/10.70675/3e84e193zcb8ez4b90z90d6za5e805dbe5e9openalex-snapshot
Modelling of crystal plasticity and grain boundary migration of 304L steel at the mesoscopic scale
inferred← citeshttps://doi.org/10.70675/bf33c9f6z92fcz4edcza31bz68cbd82b24bdopenalex-snapshot
On the similarities of trees : the interest of enumeration and compression methods
inferred← citeshttps://doi.org/10.70675/ec69e9c9ze3a3z4ca9z855czf50f5dd11fa8openalex-snapshot
Investigating decomposition methods for the maximum common subgraph and sum colouring problems
inferred← citeshttps://doi.org/10.7151/dmgt.1958openalex-snapshot
Forbidden structures for planar perfect consecutively colourable graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2533openalex-snapshot
Hypergraph operations preserving sc-greediness
inferred← citeshttps://doi.org/10.7763/ijcte.2013.v5.817openalex-snapshot
Memetic Algorithm to Solve Graph Coloring Problem
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.