The following pages link to Zheng-Ke Miao (Q698551):
Displayed 50 items.
- (Q247957) (redirect page) (← links)
- Element deletion changes in dynamic coloring of graphs (Q271647) (← links)
- Adjacent vertex distinguishing total colorings of 2-degenerate graphs (Q294532) (← links)
- Hamiltonian cycles in critical graphs with large maximum degree (Q343761) (← links)
- Circuit extension and circuit double cover of graphs (Q390272) (← links)
- \(L(p,2,1)\)-labeling of the infinite regular trees (Q393463) (← links)
- On strong list edge coloring of subcubic graphs (Q400392) (← links)
- On strongly \(\mathbb{Z}_{2s + 1}\)-connected graphs (Q400521) (← links)
- Bases of primitive nonpowerful sign patterns (Q443725) (← links)
- Unique Fulkerson coloring of Petersen minor-free cubic graphs (Q458594) (← links)
- Strong list edge coloring of subcubic graphs (Q460435) (← links)
- Adjacent vertex distinguishing indices of planar graphs without 3-cycles (Q482220) (← links)
- Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable (Q489724) (← links)
- New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs (Q533885) (← links)
- The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs (Q548395) (← links)
- The base of a primitive, nonpowerful sign pattern with exactly \(d\) nonzero diagonal entries (Q626867) (← links)
- Identifying codes and locating-dominating sets on paths and cycles (Q642979) (← links)
- A note on reducible cycles in multipartite tournaments (Q698553) (← links)
- Neighbor sum distinguishing total coloring of graphs with bounded treewidth (Q724731) (← links)
- Generalized normal matrices (Q1003943) (← links)
- Local bases of primitive non-powerful signed digraphs (Q1011709) (← links)
- Improper choosability of graphs embedded on the surface of genus \(r\) (Q1402089) (← links)
- The second exponent set of primitive digraphs (Q1567597) (← links)
- Neighbor sum distinguishing index of 2-degenerate graphs (Q1680491) (← links)
- Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable (Q1690217) (← links)
- Neighbor sum distinguishing list total coloring of subcubic graphs (Q1743484) (← links)
- Inertially arbitrary (\(2r-1\))-diagonal sign patterns (Q1855411) (← links)
- Sufficient conditions for a planar graph to be list edge \(\Delta \)-colorable and list totally \((\Delta +1)\)-colorable (Q1939571) (← links)
- Three conjectures on the signed cycle domination in graphs (Q1956250) (← links)
- The local exponent sets of primitive digraphs (Q1973914) (← links)
- List star edge coloring of \(k\)-degenerate graphs (Q1999752) (← links)
- All quadrilateral-wheel planar Ramsey numbers (Q2014216) (← links)
- Nowhere-zero 3-flows in toroidal graphs (Q2072180) (← links)
- Note on injective edge-coloring of graphs (Q2074357) (← links)
- List star edge coloring of generalized Halin graphs (Q2092427) (← links)
- On the size of \((K_t, P_k)\)-co-critical graphs (Q2163839) (← links)
- Eulerian subgraphs and \(S\)-connectivity of graphs (Q2185427) (← links)
- On the size of special class 1 graphs and \((P_3;k)\)-co-critical graphs (Q2231720) (← links)
- Upper bounds on the maximum degree of class two graphs on surfaces (Q2286600) (← links)
- Upper bounds on list star chromatic index of sparse graphs (Q2287772) (← links)
- Some remarks on interval colorings of complete tripartite and biregular graphs (Q2306598) (← links)
- On the local base of a primitive and nonpowerful sign pattern (Q2342636) (← links)
- Neighbor sum distinguishing edge colorings of sparse graphs (Q2355754) (← links)
- Adjacent vertex distinguishing total coloring of graphs with maximum degree 4 (Q2374166) (← links)
- Supereulerian width of dense graphs (Q2404391) (← links)
- Finding \(\Delta (\Sigma)\) for a surface \(\Sigma \) of characteristic \(-6\) and \(-7\) (Q2409528) (← links)
- Upper bounds on adjacent vertex distinguishing total chromatic number of graphs (Q2410247) (← links)
- The total eccentricity sum of non-adjacent vertex pairs in graphs (Q2421417) (← links)
- Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts (Q2441610) (← links)
- On the independence number of edge chromatic critical graphs (Q2509546) (← links)