The following pages link to L'udovít Niepel (Q967347):
Displaying 50 items.
- A unified approach to the first derivatives of graph polynomials (Q1805447) (← links)
- Parsons graphs of matrices (Q1812760) (← links)
- Number of triangular packings of a marked graph on a projective plane (Q1814064) (← links)
- Algorithmic aspect of \(k\)-tuple domination in graphs. (Q1860929) (← links)
- Edge-connectivity in \(P_k\)-path graphs (Q1887639) (← links)
- Intersection rules for consensus \(n\)-trees (Q1895115) (← links)
- On clique convergent graphs (Q1900516) (← links)
- \((g,f)\)-factorization orthogonal to a star in graphs (Q1902277) (← links)
- Parsons graphs of matrices on \(\mathcal Z_{p^ n}\) (Q1910562) (← links)
- On the number of edges in graphs with a given connected domination number (Q1972141) (← links)
- A new property of binary undirected de Bruijn graphs (Q1976593) (← links)
- Multi-intersection graphs (Q1978159) (← links)
- On large subgraphs of a distance graph which have small chromatic number (Q2342369) (← links)
- Locating-paired-dominating sets in square grids (Q2346332) (← links)
- Most unbreakable murky graphs are bull-free (Q2366956) (← links)
- Compatibility in a graph-theoretic setting (Q2367164) (← links)
- Conservative weightings and ear-decompositions of graphs (Q2367443) (← links)
- Edge-connectivity and edge-superconnectivity in sequence graphs (Q2384389) (← links)
- On the connectivity of diamond-free graphs (Q2384395) (← links)
- A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs (Q2403987) (← links)
- Locating and identifying codes in circulant networks (Q2446842) (← links)
- Characterization of graphs with infinite cyclic edge connectivity (Q2483391) (← links)
- On 3-regular 4-ordered graphs (Q2483395) (← links)
- Linkability in iterated line graphs (Q2488940) (← links)
- A refinement of Halin's end-faithful spanning tree theorem (Q2640605) (← links)
- New results on the Zarankiewicz problem (Q2643330) (← links)
- Connectivity of path graphs (Q2725182) (← links)
- Radii and centers in iterated line digraphs (Q2785647) (← links)
- (Q2969111) (← links)
- (Q3011738) (← links)
- (Q3088442) (← links)
- (Q3090476) (← links)
- (Q3115016) (← links)
- (Q3315542) (← links)
- (Q3340901) (← links)
- (Q3428642) (← links)
- Histories in Path Graphs (Q3439590) (← links)
- (Q3853667) (← links)
- (Q3855216) (← links)
- Elevation of a graph (Q3931448) (← links)
- (Q4374712) (← links)
- (Q4529522) (← links)
- (Q4783810) (← links)
- (Q4838485) (← links)
- (Q4944758) (← links)
- (Q5286018) (← links)
- Histories in path graphs (Q5443846) (← links)
- Iterated line graphs are maximally ordered (Q5471014) (← links)
- (Q5478339) (← links)
- Connectivity of iterated line graphs (Q5917466) (← links)
