Pages that link to "Item:Q1883636"
From MaRDI portal
The following pages link to Coloring with no 2-colored \(P_4\)'s (Q1883636):
Displaying 50 items.
- A polyhedral investigation of star colorings (Q284838) (← links)
- I,F-partitions of sparse graphs (Q298327) (← links)
- Star chromatic bounds (Q327688) (← links)
- Star coloring of graphs with girth at least five (Q343773) (← links)
- Star coloring of cubic graphs (Q402363) (← links)
- From the plane to higher surfaces (Q444375) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms (Q522969) (← links)
- Nonrepetitive colouring via entropy compression (Q524188) (← links)
- Acyclic vertex coloring of graphs of maximum degree 5 (Q626789) (← links)
- Acyclic and star colorings of cographs (Q643025) (← links)
- Degenerate and star colorings of graphs on surfaces (Q661942) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- On forbidden subdivision characterizations of graph classes (Q925035) (← links)
- Nonrepetitive colorings of graphs of bounded tree-width (Q941387) (← links)
- Generalization of transitive fraternal augmentations for directed graphs and its applications (Q1043997) (← links)
- Chromatic numbers of exact distance graphs (Q1633747) (← links)
- Star 5-edge-colorings of subcubic multigraphs (Q1699535) (← links)
- Star coloring of certain graph classes (Q1706426) (← links)
- Graph 2-rankings (Q1733856) (← links)
- \(\mathcal Q\)-Ramsey classes of graphs (Q1761462) (← links)
- On the number of 2-packings in a connected graph (Q1761463) (← links)
- On chromatic numbers of two extensions of planar graphs (Q2000818) (← links)
- An upper bound for the choice number of star edge coloring of graphs (Q2008856) (← links)
- Star list chromatic number of planar subcubic graphs (Q2015785) (← links)
- On star edge colorings of bipartite and subcubic graphs (Q2028078) (← links)
- Representing graphs as the intersection of cographs and threshold graphs (Q2040010) (← links)
- List star edge-coloring of claw-free subcubic multigraphs (Q2065794) (← links)
- Star colouring of bounded degree graphs and regular graphs (Q2124639) (← links)
- The complexity of restricted star colouring (Q2161257) (← links)
- Intersection dimension and graph invariants (Q2214313) (← links)
- On the star chromatic index of generalized Petersen graphs (Q2227104) (← links)
- Hat chromatic number of graphs (Q2231730) (← links)
- On the weak 2-coloring number of planar graphs (Q2237215) (← links)
- Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6 (Q2279264) (← links)
- Star coloring outerplanar bipartite graphs (Q2312070) (← links)
- On acyclically 4-colorable maximal planar graphs (Q2318233) (← links)
- On vertex rankings of graphs and its relatives (Q2342634) (← links)
- Equitable partition of graphs into induced forests (Q2342637) (← links)
- Boxicity of graphs on surfaces (Q2376090) (← links)
- Universal targets for homomorphisms of edge-colored graphs (Q2407379) (← links)
- Grad and classes with bounded expansion. I: Decompositions (Q2426456) (← links)
- Distance-two coloring of sparse graphs (Q2441647) (← links)
- On the tree-depth of random graphs (Q2442213) (← links)
- Weak acyclic coloring and asymmetric coloring games (Q2488942) (← links)
- Upward three-dimensional grid drawings of graphs (Q2503149) (← links)
- On star 5-colorings of sparse graphs (Q2656970) (← links)
- Weak Unit Disk and Interval Representation of Graphs (Q2827814) (← links)
- Acyclic Vertex Coloring of Graphs of Maximum Degree Six (Q2840537) (← links)
- Intersection Dimension and Maximum Degree (Q2840562) (← links)
