Maximal circuits of graphs. I
From MaRDI portal
Publication:4103567
DOI10.1007/BF01902497zbMath0337.05128MaRDI QIDQ4103567
Publication date: 1976
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Related Items (42)
Dense on-line arbitrarily partitionable graphs ⋮ On some three-color Ramsey numbers for paths ⋮ A subexponential algorithm for the coloured tree partition problem ⋮ Extremal graphs for the distinguishing index ⋮ Stability in the Erdős-Gallai theorems on cycles and paths ⋮ The proper 2-connection number and size of graphs ⋮ Proper connection and size of graphs ⋮ Unnamed Item ⋮ The maximum number of cliques in graphs without long cycles ⋮ Ordering \(Q\)-indices of graphs: given size and circumference ⋮ The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number ⋮ Exact bipartite Turán numbers of large even cycles ⋮ (1, 2)-rainbow connection number at most 3 in connected dense graphs ⋮ The Number of Cliques in Graphs Covered by Long Cycles ⋮ On the saturation spectrum of families of cycle subdivisions ⋮ The maximum number of cliques in graphs with prescribed order, circumference and minimum degree ⋮ Non-Hamiltonian graphs with large minimum degree ⋮ Maximizing the degree powers of graphs with fixed size ⋮ Extremal Numbers for Odd Cycles ⋮ Stability of Woodall's theorem and spectral conditions for large cycles ⋮ Dense arbitrarily partitionable graphs ⋮ Stability in the Erdős-Gallai theorem on cycles and paths. II ⋮ Spectral radius and Hamiltonian properties of graphs, II ⋮ Ramsey numbers for theta graphs ⋮ Long cycles in subgraphs with prescribed minimum degree ⋮ Maximal cycles in graphs ⋮ The codiameter of a 2-connected graph ⋮ Cycles and stability ⋮ Graphs with almost all edges in long cycles ⋮ Minimum degree and size conditions for the proper connection number of graphs ⋮ Cycles in 2-connected graphs ⋮ On mixed Ramsey numbers ⋮ Linear trees in uniform hypergraphs ⋮ Inverting the Turán problem with chromatic number ⋮ Conflict-free connection number and size of graphs ⋮ Extensions of the Erdős–Gallai theorem and Luo’s theorem ⋮ On \(r\)-uniform hypergraphs with circumference less than \(r\) ⋮ Spectral radius and Hamiltonian properties of graphs ⋮ On some three color Ramsey numbers for paths and cycles ⋮ Stability results on the circumference of a graph ⋮ On 2-connected hypergraphs with no long cycles ⋮ Long cycles in bipartite graphs
Cites Work
This page was built for publication: Maximal circuits of graphs. I
