arXiv (All)
open access
Sub-quorum colorings of graphs
A sub-quorum coloring is a partial vertex coloring in which every colored vertex sees at least half of its colored closed neighborhood in its own color. The notion was proposed by Hedetniemi, Hedetniemi, Laskar and Mulder as an open direction in their foundational work on quorum colorings. We furthe
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
- Tight minimum degree conditions for apex-outerplanar minors and subdivisions in graphs and digraphs#987368
- Digraphs of Large Girth and Dichromatic Number in Tournaments with Large Dichromatic Number#1036284
- Quorum colorings of maximum cardinality in linear time for a subclass of perfect trees#1013364
- B-coloring of $K_{2,t}$-free planar graphs#1070014
- A disproof of a gap-one conjecture for the equitable chromatic number of block graphs#609675
Record · ID 1051621
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