Graph theory
From MaRDI portal
Graph theory (scientific article; zbMATH DE number 5202336)
basic graph theory: treescliquescoverings and packings in directed graphscycles: nonseparable graphs: tree-search algorithmsedge colouringselectrical networksflows in networks: complexity of algorithms: connectivityfour-colour problemhamilton cyclesinteger flows and coveringsmap colouringsmatchingsplanar graphsprobabilistic methodRamsey theoryregularity lemmastable setsvertex colourings
Recommendations
Cited in
(only showing first 100 items - show all)- The connectivity of a graph and its complement
- Some three-color Ramsey numbers, R(P₄,P₅,C_k) and R(P₄,P₆,C_k)
- Every line graph of a 4-edge-connected graph is \(\mathbf Z_3\)-connected
- Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
- On the combinatorial structure of a class of \(\left[ \binom m 2, \binom{m-1}{2}, 3\right]\) shortened Hamming codes and their dual-codes
- On extremal unicyclic molecular graphs with maximal Hosoya index
- A note on list improper coloring of plane graphs
- The Ramsey number for a cycle of length six versus a clique of order eight
- On mod \((2p+1)\)-orientations of graphs
- Complexity of conditional colorability of graphs
- Extremal Hosoya index and Merrifield-Simmons index of hexagonal spiders
- The neighbour-scattering number can be computed in polynomial time for interval graphs
- On the bipanpositionable bipanconnectedness of hypercubes
- The subdivision-constrained minimum spanning tree problem
- On the inapproximability of independent domination in \(2P_3\)-free perfect graphs
- Generalized honeycomb torus
- Ring embedding in faulty pancake graphs
- Minimizing a class of unicyclic graphs by means of Hosoya index
- Upper bounds and algorithms for parallel knock-out numbers
- Long paths in hypercubes with conditional node-faults
- On the signed edge domination number of graphs
- On 3-restricted edge connectivity of undirected binary Kautz graphs
- Tactical (de-)compositions of symmetric configurations
- Semi-hyper-connected vertex transitive graphs
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- The total chromatic number of pseudo-Halin graphs with lower degree
- A generalization of Fan's results: Distribution of cycle lengths in graphs
- A constructive characterization of total domination vertex critical graphs
- Nowhere-zero 4-flow in almost Petersen-minor free graphs
- The Ramsey number \(R(C_8,K_8)\)
- On 2-factors with cycles containing specified edges in a bipartite graph
- Vertex pancyclicity in quasi-claw-free graphs
- \((s,m)\)-radius of \(k\)-connected graphs
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- The Laplacian spectral radius of some graphs
- The cone of balanced subgraphs
- The strong chromatic index of complete cubic Halin graphs
- A line digraph of a complete bipartite digraph
- Extraconnectivity of hypercubes
- The stability number and connected \([k,k+1]\)-factor in graphs
- Enumerating spanning trees of graphs with an involution
- Polynomial cases of graph decomposition: A complete solution of Holyer's problem
- Extreme values of the sum of squares of degrees of bipartite graphs
- Dirac-type generalizations concerning large cycles in graphs
- Globally bi-3*-connected graphs
- Covering the vertices of a graph with cycles of bounded length
- Hamilton cycles in claw-heavy graphs
- Degree condition for the existence of a k-factor containing a given Hamiltonian cycle
- On 3-choosable planar graphs of girth at least 4
- Finding Hamiltonian cycles in \(\{\)quasi-claw, \(K_{1,5},K_{1,5} + e\}\)-free graphs with bounded Dilworth numbers
- Bipartite rainbow numbers of matchings
- Circumferences and minimum degrees in 3-connected claw-free graphs
- The obstructions for toroidal graphs with no \(K_{3,3}\)'s
- Degree conditions and degree bounded trees
- Circle graphs and the cycle double cover conjecture
- \(\beta\)-neighborhood closures for graphs
- \(\beta \)-degree closures for graphs
- Planar graphs without 5-cycles or without 6-cycles
- Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs
- Collapsible graphs and reductions of line graphs
- Complete solution for the rainbow numbers of matchings
- M-alternating Hamilton paths and M-alternating Hamilton cycles
- A note on transformations of edge colorings of bipartite graphs
- On a conjecture of the Randić index
- A kind of conditional vertex connectivity of star graphs
- On the spanning fan-connectivity of graphs
- The number of independent sets in unicyclic graphs with a given diameter
- Hamiltonian connectedness in 3-connected line graphs
- Bi-cycle extendable through a given set in balanced bipartite graphs
- Super-connected arc-transitive digraphs
- Minimally 3-restricted edge connected graphs
- On pseudo 2-factors
- Conditional matching preclusion for hypercube-like interconnection networks
- On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
- Mutually orthogonal Hamiltonian connected graphs
- Embedding connected double-loop networks with even cardinality in books
- Acyclic edge coloring of planar graphs with large girth
- Bounds of eigenvalues of \(K_{3,3}\)-minor free graphs
- The spread of the unicyclic graphs
- New results on chromatic index critical graphs
- Traceability of line graphs
- Fully cycle extendability of \(K_{1,4}\)-restricted graphs
- Independence number, connectivity and \((a,b,k)\)-critical graphs
- On distance local connectivity and the Hamiltonian index
- A new lower bound on the number of trivially noncontractible edges in contraction critical 5-connected graphs
- The supereulerian graphs in the graph family \(C(l,k)\)
- A note on Berge-Fulkerson coloring
- Edges of degree \(k\) in minimally restricted \(k\)-edge connected graphs
- On cyclic edge-connectivity of transitive graphs
- On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
- On the minimum real roots of the adjoint polynomial of a graph
- Degree sum conditions for oriented forests in digraphs
- The k-restricted edge connectivity of undirected Kautz graphs
- On Enomoto's problems in a bipartite graph
- The super connectivity of shuffle-cubes
- Edge-fault-tolerant edge-bipancyclicity of hypercubes
- Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs
- Flows, flow-pair covers and cycle double covers
- Hamiltonicity in vertex envelopes of plane cubic graphs
- Hamilton-connected indices of graphs
This page was built for publication: Graph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5422499)