The following pages link to (Q5564127):
Displaying 50 items.
- Total-colorings of complete multipartite graphs using amalgamations (Q271641) (← links)
- Total coloring of planar graphs without chordal 7-cycles (Q272520) (← links)
- A note on the size of edge-chromatic 4-critical graphs (Q294519) (← links)
- Power domination of the Cartesian product of graphs (Q322042) (← links)
- Total chromatic number and some topological indices (Q327680) (← links)
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- Hamiltonian cycles in critical graphs with large maximum degree (Q343761) (← links)
- On edge colorings of 1-toroidal graphs (Q353624) (← links)
- Bounds on the 2-rainbow domination number of graphs (Q354420) (← links)
- Coloring, location and domination of corona graphs (Q372395) (← links)
- Total coloring of planar graphs with 7-cycles containing at most two chords (Q391771) (← links)
- Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees (Q396727) (← links)
- Total chromatic number of generalized Mycielski graphs (Q396736) (← links)
- Total colorings of \(F_5\)-free planar graphs with maximum degree 8 (Q405156) (← links)
- \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles (Q407567) (← links)
- On the average degree of critical graphs with maximum degree six (Q409377) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic (Q476647) (← links)
- On Cartesian products having a minimum dominating set that is a box or a stairway (Q497315) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Interval edge-colorings of composition of graphs (Q516842) (← links)
- A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five (Q520529) (← links)
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable (Q534337) (← links)
- Total coloring of planar graphs without 6-cycles (Q617651) (← links)
- Total choosability of planar graphs with maximum degree 4 (Q617905) (← links)
- Total coloring of embedded graphs of maximum degree at least ten (Q625795) (← links)
- Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles (Q641163) (← links)
- Fractional total colourings of graphs of high girth (Q651031) (← links)
- Entire colouring of plane graphs (Q651038) (← links)
- Graph distance measures based on topological indices revisited (Q669403) (← links)
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable (Q708386) (← links)
- Some results on Vizing's conjecture and related problems (Q714041) (← links)
- A total-chromatic number analogue of Plantholt's theorem (Q750449) (← links)
- Grundy domination of forests and the strong product conjecture (Q831340) (← links)
- Sizes of critical graphs with small maximum degrees (Q882787) (← links)
- The total chromatic number of complete multipartite graphs with low deficiency (Q897273) (← links)
- Facial entire colouring of plane graphs (Q898120) (← links)
- Total colorings of planar graphs without small cycles (Q937252) (← links)
- On the upper total domination number of Cartesian products of graphs (Q941836) (← links)
- Adjacent vertex distinguishing total colorings of outerplanar graphs (Q965812) (← links)
- The average degree of a multigraph critical with respect to edge or total choosability (Q966012) (← links)
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable (Q967320) (← links)
- Rainbow domination on trees (Q968106) (← links)
- Note on 2-rainbow domination and Roman domination in graphs (Q972956) (← links)
- On the size of critical graphs with maximum degree 8 (Q982631) (← links)
- Vizing's conjecture for chordal graphs (Q1024500) (← links)
- On the \(\{k\}\)-domination number of Cartesian products of graphs (Q1025971) (← links)
- Equitable total coloring of \(C_m\square C_n\) (Q1028450) (← links)
- On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles (Q1033023) (← links)
- On the total \(\{k\}\)-domination number of Cartesian products of graphs (Q1037451) (← links)
