The following pages link to Degree constrained subgraphs (Q2482112):
Displaying 50 items.
- A note on adjacent vertex distinguishing colorings of graphs (Q266908) (← links)
- Group sum chromatic number of graphs (Q268265) (← links)
- Total edge irregularity strength of generalized prism (Q272396) (← links)
- On decomposing graphs of large minimum degree into locally irregular subgraphs (Q286116) (← links)
- The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture (Q326818) (← links)
- Algorithmic complexity of proper labeling problems (Q391137) (← links)
- Distant irregularity strength of graphs (Q394284) (← links)
- Colour-blind can distinguish colour pallets (Q405211) (← links)
- Computation of lucky number of planar graphs is NP-hard (Q413250) (← links)
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs (Q472134) (← links)
- A note on vertex colorings of plane graphs (Q472144) (← links)
- Total weight choosability of Mycielski graphs (Q512875) (← links)
- On weight choosabilities of graphs with bounded maximum average degree (Q516900) (← links)
- Vertex-coloring 2-edge-weighting of graphs (Q607360) (← links)
- Coloring chip configurations on graphs and digraphs (Q763476) (← links)
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture (Q965260) (← links)
- Lucky labelings of graphs (Q989579) (← links)
- On vertex-coloring 13-edge-weighting (Q1001315) (← links)
- Edge irregular total labellings for graphs of linear size (Q1043545) (← links)
- A note on the weak \((2,2)\)-conjecture (Q1625809) (← links)
- Colourings of graphs by labellings (Q1687834) (← links)
- On the neighbour sum distinguishing index of graphs with bounded maximum average degree (Q1696532) (← links)
- On offset Hamilton cycles in random hypergraphs (Q1701116) (← links)
- A note on asymptotically optimal neighbour sum distinguishing colourings (Q1715623) (← links)
- Equitable neighbour-sum-distinguishing edge and total colourings (Q1786869) (← links)
- Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs (Q2008185) (← links)
- Distant sum distinguishing index of graphs (Q2012525) (← links)
- Factors of bi-regular bipartite graphs (Q2081492) (← links)
- Every nice graph is (1,5)-choosable (Q2171030) (← links)
- Neighbour-distinguishing labellings of powers of paths and powers of cycles (Q2175048) (← links)
- The 1-2-3 conjecture almost holds for regular graphs (Q2222048) (← links)
- From the 1-2-3 conjecture to the Riemann hypothesis (Q2225418) (← links)
- Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture (Q2274072) (← links)
- On decomposing regular graphs into locally irregular subgraphs (Q2349960) (← links)
- Vertex-coloring 3-edge-weighting of some graphs (Q2374171) (← links)
- The edge-labeling and vertex-colors of \(K_n\) (Q2391759) (← links)
- Distant irregularity strength of graphs with bounded minimum degree (Q2410259) (← links)
- On approximating the \(d\)-girth of a graph (Q2444552) (← links)
- The complexity of the proper orientation number (Q2445254) (← links)
- A note on face coloring entire weightings of plane graphs (Q2450136) (← links)
- Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs (Q2629488) (← links)
- A relaxed case on 1-2-3 conjecture (Q2631083) (← links)
- Neighbor sum distinguishing index of \(K_4\)-minor free graphs (Q2631098) (← links)
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree (Q2636830) (← links)
- On the standard \((2,2)\)-conjecture (Q2662793) (← links)
- On Approximating the d-Girth of a Graph (Q3075539) (← links)
- Antifactors of regular bipartite graphs (Q3386611) (← links)
- Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited (Q3466345) (← links)
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results (Q3602827) (← links)
