Pages that link to "Item:Q2532282"

The following pages link to On the degrees of the vertices of a directed graph (Q2532282):

Displaying 50 items.

• Degree-constrained graph orientation: maximum satisfaction and minimum violation (Q260260) (← links)
• Extended formulations for sparsity matroids (Q304267) (← links)
• Coloring, sparseness and girth (Q312271) (← links)
• Coloring games on squares of graphs (Q408174) (← links)
• Directed domination in oriented graphs (Q423913) (← links)
• Degrees in oriented hypergraphs and sparse Ramsey theory (Q458290) (← links)
• Tournaments associated with multigraphs and a theorem of Hakimi (Q472972) (← links)
• Orientations of graphs with prescribed weighted out-degrees (Q489364) (← links)
• Decomposing a graph into pseudoforests with one having bounded degree (Q490985) (← links)
• Riemann-Roch theory for graph orientations (Q509688) (← links)
• The minimum feasible tileset problem (Q666670) (← links)
• Infinitely connected subgraphs in graphs of uncountable chromatic number (Q681605) (← links)
• A rooted-forest partition with uniform vertex demand (Q695323) (← links)
• Decomposing a graph into forests: the nine dragon tree conjecture is true (Q722313) (← links)
• Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
• Decomposing a graph into forests (Q765188) (← links)
• Packing of Steiner trees and \(S\)-connectors in graphs (Q765198) (← links)
• Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs (Q958684) (← links)
• An upper bound on adaptable choosability of graphs (Q1003583) (← links)
• On mod \((2p+1)\)-orientations of graphs (Q1003841) (← links)
• Rooted \(k\)-connections in digraphs (Q1025990) (← links)
• Generalization of transitive fraternal augmentations for directed graphs and its applications (Q1043997) (← links)
• Adaptable chromatic number of graph products (Q1045010) (← links)
• Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences (Q1050376) (← links)
• On orientations and shortest paths (Q1123899) (← links)
• On the orientation of graphs (Q1144041) (← links)
• On the realization of a (p,s)-digraph with prescribed degrees (Q1216320) (← links)
• Relations between graphs and integer-pair sequences (Q1226508) (← links)
• Combined connectivity augmentation and orientation problems (Q1410691) (← links)
• Modulo orientations with bounded independence number (Q1671302) (← links)
• Proper orientations of planar bipartite graphs (Q1684937) (← links)
• A connection between sports and matroids: how many teams can we beat? (Q1702129) (← links)
• Combinatorics of compactified universal Jacobians (Q1731590) (← links)
• Distance between \(\alpha\)-orientations of plane graphs by facial cycle reversals (Q1734961) (← links)
• A note on strong edge coloring of sparse graphs (Q1734962) (← links)
• Decomposing a graph into forests and a matching (Q1748265) (← links)
• New linearizations of quadratic assignment problems (Q1761235) (← links)
• The reversing number of a digraph (Q1894351) (← links)
• The number of 3-SAT functions (Q1936820) (← links)
• Lattices, graphs, and Conway mutation (Q1955773) (← links)
• Assur decompositions of direction-length frameworks (Q2056896) (← links)
• Upper and lower degree-constrained graph orientation with minimum penalty (Q2062132) (← links)
• Decreasing minimization on M-convex sets: algorithms and applications (Q2089795) (← links)
• Locating-dominating sets: from graphs to oriented graphs (Q2092344) (← links)
• Local planar domination revisited (Q2097345) (← links)
• The existence of planar 4-connected essentially 6-edge-connected graphs with no claw-decompositions (Q2105863) (← links)
• Modulo orientations and matchings in graphs (Q2138971) (← links)
• On coloring numbers of graph powers (Q2174571) (← links)
• Proper 3-orientations of bipartite planar graphs with minimum degree at least 3 (Q2181231) (← links)
• Contractible graphs for flow index less than three (Q2198393) (← links)