Pages that link to "Item:Q5785127"
From MaRDI portal
The following pages link to The Factorization of Linear Graphs (Q5785127):
Displaying 41 items.
- Many Visits TSP Revisited (Q5874538) (← links)
- Properties of hyperprimitive graphs (Q5895361) (← links)
- Circular edge-colorings of cubic graphs with girth six (Q5900963) (← links)
- Three‐regular subgraphs of four‐regular graphs (Q5904287) (← links)
- Domination critical graphs (Q5917319) (← links)
- On Ramsey minimal graphs (Q5917560) (← links)
- On generalizations of matching-covered graphs (Q5946644) (← links)
- Spectral characterization of matchings in graphs (Q5965406) (← links)
- The maximal genus of planar graphs (Q5966541) (← links)
- Fractional matching, factors and spectral radius in graphs involving minimum degree (Q6051148) (← links)
- Finding Maximum Edge-Disjoint Paths Between Multiple Terminals (Q6057790) (← links)
- Connections between graphs and matrix spaces (Q6074039) (← links)
- Eigenvalues and [a,b]‐factors in regular graphs (Q6081550) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- A proof of the Erdős-Faber-Lovász conjecture (Q6093285) (← links)
- Minimally \(k\)-factor-critical graphs for some large \(k\) (Q6115428) (← links)
- Polyhedral techniques in combinatorial optimization: matchings and tours (Q6118160) (← links)
- A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with \(2 \times 2\) submatrices (Q6120836) (← links)
- Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical (Q6124438) (← links)
- Groups, Graphs, and Hypergraphs: Average Sizes of Kernels of Generic Matrices with Support Constraints (Q6124916) (← links)
- An improvement on Łuczak's connected matchings method (Q6133269) (← links)
- Smith normal form and the generalized spectral characterization of oriented graphs (Q6156930) (← links)
- Resolution of the Erdős–Sauer problem on regular subgraphs (Q6169130) (← links)
- Unions of perfect matchings in \(r\)-graphs (Q6172292) (← links)
- Bi-oriented graphs and four valued logic for preference modelling (Q6179217) (← links)
- Minimum degree of minimal \((n-10)\)-factor-critical graphs (Q6197704) (← links)
- How many matchings cover the nodes of a graph? (Q6201927) (← links)
- Finding triangle-free 2-factors in general graphs (Q6540256) (← links)
- Perfect matching and zero-sum 3-magic labeling (Q6558939) (← links)
- Randomized parallel algorithms (Q6560203) (← links)
- Sufficient conditions for a graph \(kG\) admitting all \([1, k]\)-factors (Q6586578) (← links)
- Cutting Barnette graphs perfectly is hard (Q6589850) (← links)
- Spectral techniques in graph theory: an introduction to adjacency matrix eigenvalues (Q6594812) (← links)
- A unified combinatorial view beyond some spectral properties (Q6635841) (← links)
- Removable edges in near-bipartite bricks (Q6642518) (← links)
- The average connectivity matrix of a graph (Q6646412) (← links)
- Euler dynamic <i>H</i> -trails in edge-colored graphs (Q6651158) (← links)
- Distance spectral radius and fractional matching in <i>t</i> -connected graphs (Q6655455) (← links)
- Degree conditions for path-factors in graphs (Q6658903) (← links)
- Pfaffians are Pfine (Q6664959) (← links)
- Algebraic algorithms for fractional linear matroid parity via noncommutative rank (Q6670353) (← links)
