The Factorization of Linear Graphs

1947/04/01 by W. T. Tutte · 56 citations
Computer Science · Engineering · #Advanced Graph Theory Research #graph theory and CDMA systems #Graph Labeling and Dimension Problems

paper · doi:10.1112/jlms/s1-22.2.107

Cited by

• Dynamic Allocation of Reusable Resources: Logarithmic Regret in Overloaded Networks
• Matchings and Near-Optimal 2-Factor Packings in Percolated Vertex-Transitive Graphs
• On the Complexity of General Graph Factor Problems
• Spectral characterization of matchings in graphs
• Hardness of Graph-Structured Algebraic and Symbolic Problems
• A sharp Randić bound for König--Egerváry graphs and a conjecture of Aouchiche, Hansen, and Zheng
• Matching of given sizes in hypergraphs
• A survey on the skew energy of oriented graphs
• Sufficient conditions for a graph with minimum degree to be k-critical with respect to [1,b]-odd factor
• The maximum number of perfect matchings of semi-regular graphs
• Anti-Ramsey Number of Stars in 3-uniform hypergraphs
• The existence of even factors based on the A_α-spectral radius of graphs
• Decision problem for Perfect Matchings in Dense k-uniform Hypergraphs
• Signless Laplacian spectral conditions for even factors in graphs
• Generating p-extremal graphs
• Distance spectral radius for a graph to be k-critical with respect to [1,b]-odd factor
• On minimal k-factor-critical planar graphs
• The n-queens problem
• Isotropy and completeness indices of multilinear maps
• From independent sets and vertex colorings to isotropic spaces and\n isotropic decompositions
• Laminar Tight Cuts in Matching Covered Graphs
• Construction of k-matchings and k-regular subgraphs in graph\n products
• Vertex-deleted subgraphs and regular factors from regular graph
• Fractional matching preclusion number of graphs
• 2-Factors in Graphs
• The Tight Cut Decomposition of Matching Covered Uniformable Hypergraphs
• Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
• Toughness in regular graphs from eigenvalues
• Wheel-like bricks and minimal matching covered graphs
• A degree sequence Hajnal--Szemerédi theorem
• Pertfect matching and zero-sum 3-magic labeling
• Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems
• Kőnig's Line Coloring and Vizing's Theorems for Graphings
• On 1-sum flows in undirected graphs
• Equivalence classes in matching covered graphs
• Matrix Representations of Transversal Matroids
• A \overrightarrowP₃-decomposition of tournaments and bipartite digraphs
• Nice vertices in cubic graphs
• Properties of Catlin's reduced graphs and supereulerian graphs
• Edge-connectivity and non-negative Lin-Lu-Yau curvature
• Integral bases, perfect matchings, and the Petersen graph
• Non-commutative Edmonds' problem and matrix semi-invariants
• Perfect matching and distance spectral radius in graphs and bipartite graphs
• Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties
• A Note on Near-factor-critical Graphs
• Comparison between the first Steklov eigenvalue and algebraic connectivity on trees
• Perfect tilings with the generalised triangle in k-graphs
• On perfect k-matchings
• Exact Matching in Matrix Multiplication Time
• Surface embedding of non-bipartite k-extendable graphs
• Graph Streaming Lower Bounds for Parameter Estimation and Property Testing via a Streaming XOR Lemma
• The Complexity of All (g,f)-Factor Problem
• The complexity of perfect matchings and packings in dense hypergraphs
• Edge-connectivity of graphs with non-negative Bakry-Émery curvature and amply regular graphs
• Unions of 1-factors in r-graphs and overfull graphs
• Enumerating alternating matrix spaces over finite fields with explicit coordinates