Star colouring of bounded degree graphs and regular graphs (Q2124639): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2022.112850 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4213456162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring with no 2-colored \(P_4\)'s / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph 2-rankings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph classes with structured neighborhoods and algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4626304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5874489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Approximately Counting Colorings of Small Degree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: 6-Star-Coloring of Subcubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of Sparse Jacobian Matrices and Graph Coloring Blems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Graph Homomorphism and Subgraph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4504904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-two coloring of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic and \(k\)-distance coloring of the grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally constrained graph homomorphisms -- structure, complexity, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Color Is Your Jacobian? Graph Coloring for Computing Derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for vertex-partitioning problems on graphs with fixed clique-width. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star chromatic index of subcubic multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP completeness of finding the chromatic index of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Eulerian orientations of even-degree hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for vertex partitioning problems parameterized by clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-colouring AT-free graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star coloring of cubic graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:40, 28 July 2024

scientific article
Language Label Description Also known as
English
Star colouring of bounded degree graphs and regular graphs
scientific article

    Statements

    Star colouring of bounded degree graphs and regular graphs (English)
    0 references
    0 references
    0 references
    11 April 2022
    0 references
    star colouring
    0 references
    regular graphs
    0 references
    complexity
    0 references
    locally checkable vertex subset
    0 references
    partitioning problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers