The following pages link to (Q4857375):
Displaying 50 items.
- Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees (Q260061) (← links)
- A note on the minimum number of choosability of planar graphs (Q266020) (← links)
- Total coloring of planar graphs without chordal 7-cycles (Q272520) (← links)
- A note on total and list edge-colouring of graphs of tree-width 3 (Q293637) (← links)
- The tournament scheduling problem with absences (Q323410) (← links)
- List edge and list total coloring of planar graphs with maximum degree 8 (Q328709) (← links)
- Hamiltonian cycles in critical graphs with large maximum degree (Q343761) (← links)
- Steinberg's conjecture is false (Q345097) (← links)
- The number of colorings of planar graphs with no separating triangles (Q345111) (← links)
- The equivalence number of a line graph (Q350825) (← links)
- Modularity-based decompositions for valued CSP (Q353312) (← links)
- Group connectivity of bridged graphs (Q354436) (← links)
- Online multi-coloring on the path revisited (Q378204) (← links)
- \(L(2,1)\)-labelings on the modular product of two graphs (Q387006) (← links)
- Total coloring of embedded graphs with maximum degree at least seven (Q391777) (← links)
- (\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6 (Q394211) (← links)
- Tension continuous maps -- their structure and applications (Q427807) (← links)
- Online variable-sized bin packing with conflicts (Q429693) (← links)
- Goodness of fit tests for a class of Markov random field models (Q450023) (← links)
- Nowhere-zero 3-flows and modulo \(k\)-orientations (Q461727) (← links)
- Ore's conjecture on color-critical graphs is almost true (Q462926) (← links)
- A note on vertex colorings of plane graphs (Q472144) (← links)
- Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker (Q472396) (← links)
- On the construction of non-2-colorable uniform hypergraphs (Q476325) (← links)
- On-line choice number of complete multipartite graphs: an algorithmic approach (Q490305) (← links)
- Distance constraints on short cycles for 3-colorability of planar graphs (Q497344) (← links)
- Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\) (Q500982) (← links)
- Hedetniemi's conjecture for uncountable graphs (Q509108) (← links)
- Maximum cardinality neighbourly sets in quadrilateral free graphs (Q511689) (← links)
- More bounds for the Grundy number of graphs (Q511707) (← links)
- Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree (Q512863) (← links)
- Interval edge-colorings of composition of graphs (Q516842) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- The edge density of critical digraphs (Q519953) (← links)
- On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number (Q539861) (← links)
- Color-critical graphs have logarithmic circumference (Q550393) (← links)
- Partitions of graphs into cographs (Q607000) (← links)
- On the edge-density of 4-critical graphs (Q624211) (← links)
- Parity vertex colouring of plane graphs (Q626871) (← links)
- The list-chromatic number of infinite graphs defined on Euclidean spaces (Q633199) (← links)
- On two generalizations of the Alon-Tarsi polynomial method (Q651032) (← links)
- On the induced matching problem (Q657915) (← links)
- List 2-facial 5-colorability of plane graphs with girth at least 12 (Q658054) (← links)
- Clique colourings of geometric graphs (Q668027) (← links)
- On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs (Q668046) (← links)
- List edge and list total coloring of 1-planar graphs (Q692658) (← links)
- On the page number of RNA secondary structures with pseudoknots (Q694703) (← links)
- Some remarks on Hajós' conjecture (Q707025) (← links)
- What is on his mind? (Q709300) (← links)
- The thickness and chromatic number of \(r\)-inflated graphs (Q709322) (← links)
