Graph 2-rankings
From MaRDI portal
Publication:1733856
DOI10.1007/s00373-018-1979-4zbMath1407.05186OpenAlexW2907761778MaRDI QIDQ1733856
Jordan Almeter, Robert Winslow, Samet Demircan, Kevin G. Milans, Andrew Kallmeyer
Publication date: 21 March 2019
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-018-1979-4
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
Star colouring of bounded degree graphs and regular graphs ⋮ The complexity of restricted star colouring ⋮ Star chromatic number of some graph products
Cites Work
- On a hypercube coloring problem
- Hereditary properties of graphs: Asymptotic enumeration, global structure, and colouring
- Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
- A dynamic survey of graph labeling
- Coloring with no 2-colored \(P_4\)'s
- On vertex rankings of graphs and its relatives
- Star coloring of graphs
- 6-Star-Coloring of Subcubic Graphs
This page was built for publication: Graph 2-rankings
