Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs (Q2515567): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Q1842143 / rank
Normal rank
 
Property / author
 
Property / author: Maria A. Axenovich / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2216812014 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1410.1219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\{k,r-k\}\)-factors of \(r\)-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-sum magic labelings and null sets of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factors and factorizations of graphs. Proof techniques in factor theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rankings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph unique-maximum and conflict-free colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Free Colouring of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free coloring of points and simple regions in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an edge ranking problem of trees and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Free Colourings of Uniform Hypergraphs With Few Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: The colour theorems of Brooks and Gallai extended / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal edge ranking of trees in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on parity factors of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Existence of General Factors in Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Free Colourings of Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On The Chromatic Number of Geometric Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Free Coloring and its Applications / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:45, 10 July 2024

scientific article
Language Label Description Also known as
English
Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs
scientific article

    Statements

    Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs (English)
    0 references
    0 references
    0 references
    5 August 2015
    0 references
    conflict-free
    0 references
    unique color
    0 references
    coloring
    0 references
    factors
    0 references
    \(\{1, t \}\)-factors
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references