Star coloring of graphs

From MaRDI portal
Publication:3159375

DOI10.1002/jgt.20029zbMath1055.05051OpenAlexW4245550773WikidataQ56001804 ScholiaQ56001804MaRDI QIDQ3159375

Guillaume Fertin, Andre Raspaud, Bruce A. Reed

Publication date: 16 February 2005

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20029




Related Items (67)

Star colouring of bounded degree graphs and regular graphsCharacterising bounded expansion by neighbourhood complexityA polyhedral investigation of star coloringsColoring parameters for graphs on surfacesStar chromatic number of some graphsStar chromatic boundsStar coloring of graphs with girth at least fiveStar Edge Coloring of the Cartesian Product of GraphsOn star 5-colorings of sparse graphsOn star coloring of modular product of graphsA generic framework for approximation analysis of greedy algorithms for star bicoloringImproved upper bound for the degenerate and star chromatic numbers of graphsA General Framework for Hypergraph ColoringAcyclic coloring of graphs without bichromatic long pathAcyclic chromatic index of chordless graphsAcyclic edge coloring of graphs with large girthsStar coloring of cubic graphsStar chromatic number of some graph productsTwo lower bounds for $p$-centered coloringsGraph colorings with restricted bicolored subgraphs: I. Acyclic, star, and treewidth coloringsInjective edge-coloring of subcubic graphsImproved bounds on coloring of graphsUnnamed ItemUpper bounds on the acyclic chromatic index of degenerate graphsStar coloring of certain graph classesFrugal, acyclic and star colourings of graphsAcyclic and star colorings of cographsA survey of graph coloring - its types, methods and applicationsIntersection dimension and graph invariantsAcyclic edge-coloring using entropy compressionAcyclic edge coloring of planar graphs with girth at least 5A polynomial time algorithm to find the star chromatic index of treesMaximizing and minimizing the number of generalized colorings of treesOn star coloring of degree splitting of join graphsDegenerate and star colorings of graphs on surfacesCharacterisations and examples of graph classes with bounded expansionGraph 2-rankingsRestricted coloring problems on graphs with few \(P_4\)'sAcyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphsAn introduction to the discharging method via graph coloring6-Star-Coloring of Subcubic GraphsA survey and classification of Sierpiński-type graphsAnagram-free graph colouringImproved Bounds for Centered ColoringsNonrepetitive colouring via entropy compressionStar Chromatic IndexAcyclic improper colourings of graphs with bounded maximum degreeImproved bounds for acyclic chromatic index of planar graphs\(\mathcal Q\)-Ramsey classes of graphsUpward three-dimensional grid drawings of graphsOn star edge colorings of bipartite and subcubic graphsStar coloring bipartite planar graphsRepresenting graphs as the intersection of cographs and threshold graphsColoring graphs without bichromatic cycles or pathsAcyclic coloring of graphs and entropy compression methodBounds on vertex colorings with restrictions on the union of color classesAcyclic and \(k\)-distance coloring of the gridStar coloring outerplanar bipartite graphsList star edge-coloring of claw-free subcubic multigraphsStar coloring of sparse graphsRestricted coloring problems on graphs with fewGraph coloring with cardinality constraints on the neighborhoodsA Local Lemma for Focused Stochastic AlgorithmsON STAR COLORING OF DEGREE SPLITTING OF COMB PRODUCT GRAPHSA Conjecture of Borodin and a Coloring of GrünbaumColourings of the Cartesian Product of Graphs and Multiplicative Sidon SetsStar coloring under some graph operations



Cites Work


This page was built for publication: Star coloring of graphs