arXiv (All)
open access
Vertex-Coloring Edge-Weighting: Kernelization and Generalization
An edge weighting of a graph induces a coloring of its vertices in which the color of a vertex is the total weight of the edges incident with it. Such an edge weighting is proper if adjacent vertices always receive distinct colors. Deciding whether a graph admits a proper weighting is known to be NP
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Unfair Sampling of Quantum Annealing in Weighted Graph Bipartitioning Problems#670559
- Unfair Sampling of Quantum Annealing in Weighted Graph Bipartitioning Problems#668494
- Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration#1156377
- Scale-aware Message Passing For Graph Node Classification#141676
- Faster Minimum k-Cut I: Simple and Sparse Weighted Graphs#1064325
Record · ID 1064263
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive